Base | Representation |
---|---|
bin | 1001010010011011000111… |
… | …1000000001101111111110 |
3 | 1100011021021022021210201212 |
4 | 2110212301320001233332 |
5 | 2314303411102021204 |
6 | 33415214525204422 |
7 | 2102541614445212 |
oct | 224466170015776 |
9 | 40137238253655 |
10 | 10212121517054 |
11 | 3287a33404406 |
12 | 118b216a00712 |
13 | 590cca8477a2 |
14 | 2743ab020942 |
15 | 12a99263cc6e |
hex | 949b1e01bfe |
10212121517054 has 8 divisors (see below), whose sum is σ = 15318338033640. Its totient is φ = 5106008839176.
The previous prime is 10212121517041. The next prime is 10212121517069. The reversal of 10212121517054 is 45071512121201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×102121215170543 (a number of 40 digits) contains 333 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10212121517054.
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, 25713344 + ... + 26107475.
It is an arithmetic number, because the mean of its divisors is an integer number (1914792254205).
Almost surely, 210212121517054 is an apocalyptic number.
10212121517054 is a deficient number, since it is larger than the sum of its proper divisors (5106216516586).
10212121517054 is an equidigital number, since it uses as much as digits as its factorization.
10212121517054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51919354.
The product of its (nonzero) digits is 5600, while the sum is 32.
Adding to 10212121517054 its reverse (45071512121201), we get a palindrome (55283633638255).
The spelling of 10212121517054 in words is "ten trillion, two hundred twelve billion, one hundred twenty-one million, five hundred seventeen thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •