Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …001010110011011111101001 |
3 | 111020122110110120111122021012 |
4 | 112331320321022303133221 |
5 | 101214421440000013001 |
6 | 554455204155553305 |
7 | 30163505651406200 |
oct | 2675707112633751 |
9 | 436573416448235 |
10 | 101010000001001 |
11 | 2a204111747903 |
12 | b3b44b875b835 |
13 | 44492820cc530 |
14 | 1ad2ca53bc237 |
15 | ba277dde42bb |
hex | 5bde392b37e9 |
101010000001001 has 24 divisors (see below), whose sum is σ = 126540703364040. Its totient is φ = 79919555772672.
The previous prime is 101010000000991. The next prime is 101010000001007. The reversal of 101010000001001 is 100100000010101.
It can be written as a sum of positive squares in 4 ways, for example, as 19389182989225 + 81620817011776 = 4403315^2 + 9034424^2 .
It is a de Polignac number, because none of the positive numbers 2k-101010000001001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101010000001007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 160143635 + ... + 160773143.
It is an arithmetic number, because the mean of its divisors is an integer number (5272529306835).
Almost surely, 2101010000001001 is an apocalyptic number.
It is an amenable number.
101010000001001 is a deficient number, since it is larger than the sum of its proper divisors (25530703363039).
101010000001001 is a wasteful number, since it uses less digits than its factorization.
101010000001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 881433 (or 881426 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 101010000001001 its reverse (100100000010101), we get a palindrome (201110000011102).
The spelling of 101010000001001 in words is "one hundred one trillion, ten billion, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •