Base | Representation |
---|---|
bin | 1001010010011101010011… |
… | …1101010100010101101110 |
3 | 1100011022210022211020122011 |
4 | 2110213110331110111232 |
5 | 2314311112241401403 |
6 | 33415353152511434 |
7 | 2102562322411315 |
oct | 224472475242556 |
9 | 40138708736564 |
10 | 10212710106478 |
11 | 3288205679350 |
12 | 118b35bb4b57a |
13 | 591092779759 |
14 | 27442527727c |
15 | 12a9c9154a6d |
hex | 949d4f5456e |
10212710106478 has 8 divisors (see below), whose sum is σ = 16711707447000. Its totient is φ = 4642140957480.
The previous prime is 10212710106449. The next prime is 10212710106499. The reversal of 10212710106478 is 87460101721201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×102127101064783 (a number of 40 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10212710106478.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 232107047853 + ... + 232107047896.
It is an arithmetic number, because the mean of its divisors is an integer number (2088963430875).
Almost surely, 210212710106478 is an apocalyptic number.
10212710106478 is a deficient number, since it is larger than the sum of its proper divisors (6498997340522).
10212710106478 is a wasteful number, since it uses less digits than its factorization.
10212710106478 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464214095762.
The product of its (nonzero) digits is 37632, while the sum is 40.
Adding to 10212710106478 its reverse (87460101721201), we get a palindrome (97672811827679).
The spelling of 10212710106478 in words is "ten trillion, two hundred twelve billion, seven hundred ten million, one hundred six thousand, four hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •