Base | Representation |
---|---|
bin | 1001010010011010110100… |
… | …1001001111110110110001 |
3 | 1100011021001202221022000121 |
4 | 2110212231021033312301 |
5 | 2314303230242121301 |
6 | 33415203012050241 |
7 | 2102536632006331 |
oct | 224465511176661 |
9 | 40137052838017 |
10 | 10212042145201 |
11 | 32879a2622136 |
12 | 118b1b4303981 |
13 | 590cb72772b0 |
14 | 2743a067d0c1 |
15 | 12a98a6b03a1 |
hex | 949ad24fdb1 |
10212042145201 has 16 divisors (see below), whose sum is σ = 11576953080000. Its totient is φ = 8929945303488.
The previous prime is 10212042145141. The next prime is 10212042145237. The reversal of 10212042145201 is 10254124021201.
It is a cyclic number.
It is not a de Polignac number, because 10212042145201 - 223 = 10212033756593 is a prime.
It is a super-2 number, since 2×102120421452012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10212042145241) 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, 4295550 + ... + 6235048.
It is an arithmetic number, because the mean of its divisors is an integer number (723559567500).
Almost surely, 210212042145201 is an apocalyptic number.
It is an amenable number.
10212042145201 is a deficient number, since it is larger than the sum of its proper divisors (1364910934799).
10212042145201 is a wasteful number, since it uses less digits than its factorization.
10212042145201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1960848.
The product of its (nonzero) digits is 1280, while the sum is 25.
Adding to 10212042145201 its reverse (10254124021201), we get a palindrome (20466166166402).
The spelling of 10212042145201 in words is "ten trillion, two hundred twelve billion, forty-two million, one hundred forty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •