Base | Representation |
---|---|
bin | 11101001000100001110… |
… | …10000000000101011001 |
3 | 10112200210011211120100201 |
4 | 32210100322000011121 |
5 | 112400032310120441 |
6 | 2043505204102201 |
7 | 132214662165400 |
oct | 16442072000531 |
9 | 3480704746321 |
10 | 1001011020121 |
11 | 356587696312 |
12 | 142004694961 |
13 | 735198939b8 |
14 | 36640822637 |
15 | 1b08a3c2c31 |
hex | e910e80159 |
1001011020121 has 6 divisors (see below), whose sum is σ = 1164441390810. Its totient is φ = 858009445776.
The previous prime is 1001011020067. The next prime is 1001011020167. The reversal of 1001011020121 is 1210201101001.
It can be written as a sum of positive squares in only one way, i.e., 866083364496 + 134927655625 = 930636^2 + 367325^2 .
It is not a de Polignac number, because 1001011020121 - 27 = 1001011019993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1001011020098 and 1001011020107.
It is not an unprimeable number, because it can be changed into a prime (1001011020181) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 10214398116 + ... + 10214398213.
It is an arithmetic number, because the mean of its divisors is an integer number (194073565135).
Almost surely, 21001011020121 is an apocalyptic number.
It is an amenable number.
1001011020121 is a deficient number, since it is larger than the sum of its proper divisors (163430370689).
1001011020121 is an equidigital number, since it uses as much as digits as its factorization.
1001011020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20428796343 (or 20428796336 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1001011020121 its reverse (1210201101001), we get a palindrome (2211212121122).
The spelling of 1001011020121 in words is "one trillion, one billion, eleven million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •