Base | Representation |
---|---|
bin | 1001010010011010101101… |
… | …0100000110000111000011 |
3 | 1100011020222122011000202211 |
4 | 2110212223110012013003 |
5 | 2314303144411400220 |
6 | 33415155553522551 |
7 | 2102536106660506 |
oct | 224465324060703 |
9 | 40136878130684 |
10 | 10212011434435 |
11 | 3287987256738 |
12 | 118b1a5b73457 |
13 | 590cb0ab3945 |
14 | 27439a56713d |
15 | 12a987b45b5a |
hex | 949ab5061c3 |
10212011434435 has 32 divisors (see below), whose sum is σ = 12457371438720. Its totient is φ = 8034946956288.
The previous prime is 10212011434433. The next prime is 10212011434477. The reversal of 10212011434435 is 53443411021201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10212011434435 - 21 = 10212011434433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10212011434397 and 10212011434406.
It is not an unprimeable number, because it can be changed into a prime (10212011434433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 821093037 + ... + 821105473.
It is an arithmetic number, because the mean of its divisors is an integer number (389292857460).
Almost surely, 210212011434435 is an apocalyptic number.
10212011434435 is a deficient number, since it is larger than the sum of its proper divisors (2245360004285).
10212011434435 is a wasteful number, since it uses less digits than its factorization.
10212011434435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18687.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 10212011434435 its reverse (53443411021201), we get a palindrome (63655422455636).
The spelling of 10212011434435 in words is "ten trillion, two hundred twelve billion, eleven million, four hundred thirty-four thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •