Base | Representation |
---|---|
bin | 1001010010010111000000… |
… | …1110000100111011101001 |
3 | 1100011011102112120222210000 |
4 | 2110211300032010323221 |
5 | 2314244132110013001 |
6 | 33414513340013213 |
7 | 2102502410636151 |
oct | 224456016047351 |
9 | 40134375528700 |
10 | 10211020001001 |
11 | 3287518654066 |
12 | 118ab69b31209 |
13 | 590b83585a41 |
14 | 274304a09761 |
15 | 12a92aaa7a86 |
hex | 94970384ee9 |
10211020001001 has 80 divisors (see below), whose sum is σ = 16500625661520. Its totient is φ = 6269610885120.
The previous prime is 10211020000949. The next prime is 10211020001003. The reversal of 10211020001001 is 10010002011201.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 482609479401 + 9728410521600 = 694701^2 + 3119040^2 .
It is not a de Polignac number, because 10211020001001 - 214 = 10211019984617 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10211020001003) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 11458161 + ... + 12317121.
It is an arithmetic number, because the mean of its divisors is an integer number (206257820769).
Almost surely, 210211020001001 is an apocalyptic number.
It is an amenable number.
10211020001001 is a deficient number, since it is larger than the sum of its proper divisors (6289605660519).
10211020001001 is an equidigital number, since it uses as much as digits as its factorization.
10211020001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 859176 (or 859167 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10211020001001 its reverse (10010002011201), we get a palindrome (20221022012202).
The spelling of 10211020001001 in words is "ten trillion, two hundred eleven billion, twenty million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •