Base | Representation |
---|---|
bin | 1001010010011011001110… |
… | …1110011001010100110101 |
3 | 1100011021100110200021021210 |
4 | 2110212303232121110311 |
5 | 2314303442022442423 |
6 | 33415221554232033 |
7 | 2102542442262333 |
oct | 224466356312465 |
9 | 40137313607253 |
10 | 10212152546613 |
11 | 3287a49978376 |
12 | 118b225285619 |
13 | 5910040c0284 |
14 | 2743b11bab53 |
15 | 12a99521bb93 |
hex | 949b3b99535 |
10212152546613 has 16 divisors (see below), whose sum is σ = 13873255663680. Its totient is φ = 6679578207744.
The previous prime is 10212152546591. The next prime is 10212152546653. The reversal of 10212152546613 is 31664525121201.
It is not a de Polignac number, because 10212152546613 - 26 = 10212152546549 is a prime.
It is a super-2 number, since 2×102121525466132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212152546653) 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 15 ways as a sum of consecutive naturals, for example, 18549370 + ... + 19091972.
It is an arithmetic number, because the mean of its divisors is an integer number (867078478980).
Almost surely, 210212152546613 is an apocalyptic number.
It is an amenable number.
10212152546613 is a deficient number, since it is larger than the sum of its proper divisors (3661103117067).
10212152546613 is a wasteful number, since it uses less digits than its factorization.
10212152546613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661028.
The product of its (nonzero) digits is 86400, while the sum is 39.
Adding to 10212152546613 its reverse (31664525121201), we get a palindrome (41876677667814).
The spelling of 10212152546613 in words is "ten trillion, two hundred twelve billion, one hundred fifty-two million, five hundred forty-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •