Base | Representation |
---|---|
bin | 101010110000100… |
… | …1110101101000101 |
3 | 10200222210002101102 |
4 | 1111201032231011 |
5 | 10414300234331 |
6 | 354212105445 |
7 | 50361244400 |
oct | 12541165505 |
9 | 3628702342 |
10 | 1434774341 |
11 | 676990220 |
12 | 340605285 |
13 | 19b335900 |
14 | d87a4d37 |
15 | 85e634cb |
hex | 5584eb45 |
1434774341 has 72 divisors (see below), whose sum is σ = 2077855200. Its totient is φ = 976510080.
The previous prime is 1434774337. The next prime is 1434774343.
1434774341 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1434774341 - 22 = 1434774337 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1434774295 and 1434774304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1434774343) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1730315 + ... + 1731143.
It is an arithmetic number, because the mean of its divisors is an integer number (28859100).
Almost surely, 21434774341 is an apocalyptic number.
1434774341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1434774341 is a deficient number, since it is larger than the sum of its proper divisors (643080859).
1434774341 is a wasteful number, since it uses less digits than its factorization.
1434774341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 899 (or 879 counting only the distinct ones).
The product of its digits is 112896, while the sum is 38.
The square root of 1434774341 is about 37878.4152387610. The cubic root of 1434774341 is about 1127.8755974693.
It can be divided in two parts, 14347 and 74341, that added together give a palindrome (88688).
The spelling of 1434774341 in words is "one billion, four hundred thirty-four million, seven hundred seventy-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •