Base | Representation |
---|---|
bin | 1100101000011001001… |
… | …10110110111101110111 |
3 | 1112111020102121102020210 |
4 | 12110030212312331313 |
5 | 24102314310210403 |
6 | 531213415000503 |
7 | 43233001263231 |
oct | 6241446667567 |
9 | 1474212542223 |
10 | 434003210103 |
11 | 158072552431 |
12 | 70142969133 |
13 | 31c071a9cc8 |
14 | 17012159251 |
15 | b451bcdb03 |
hex | 650c9b6f77 |
434003210103 has 32 divisors (see below), whose sum is σ = 592325858560. Its totient is φ = 282578595840.
The previous prime is 434003210083. The next prime is 434003210117. The reversal of 434003210103 is 301012300434.
It is not a de Polignac number, because 434003210103 - 28 = 434003209847 is a prime.
It is a super-2 number, since 2×4340032101032 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 434003210103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (434003210153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34386528 + ... + 34399146.
It is an arithmetic number, because the mean of its divisors is an integer number (18510183080).
Almost surely, 2434003210103 is an apocalyptic number.
434003210103 is a deficient number, since it is larger than the sum of its proper divisors (158322648457).
434003210103 is a wasteful number, since it uses less digits than its factorization.
434003210103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13999.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 434003210103 its reverse (301012300434), we get a palindrome (735015510537).
The spelling of 434003210103 in words is "four hundred thirty-four billion, three million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •