Base | Representation |
---|---|
bin | 1001001001000001000100… |
… | …01110010110010011100001 |
3 | 2122011122020201112201200012 |
4 | 10210200202032112103201 |
5 | 10113313342402211001 |
6 | 110430140455334305 |
7 | 4143152020333415 |
oct | 444404216262341 |
9 | 78148221481605 |
10 | 20101021132001 |
11 | 644a88243a787 |
12 | 2307867381395 |
13 | b2a69751c0a4 |
14 | 4d6c74b6ad45 |
15 | 24cd18a782bb |
hex | 1248223964e1 |
20101021132001 has 8 divisors (see below), whose sum is σ = 20145287672640. Its totient is φ = 20056759821648.
The previous prime is 20101021131979. The next prime is 20101021132009. The reversal of 20101021132001 is 10023112010102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20101021132001 - 234 = 20083841262817 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20101021132009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6437735 + ... + 9035843.
It is an arithmetic number, because the mean of its divisors is an integer number (2518160959080).
Almost surely, 220101021132001 is an apocalyptic number.
It is an amenable number.
20101021132001 is a deficient number, since it is larger than the sum of its proper divisors (44266540639).
20101021132001 is a wasteful number, since it uses less digits than its factorization.
20101021132001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2615143.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 20101021132001 its reverse (10023112010102), we get a palindrome (30124133142103).
The spelling of 20101021132001 in words is "twenty trillion, one hundred one billion, twenty-one million, one hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •