Base | Representation |
---|---|
bin | 11101000110101010011… |
… | …11110101000011000001 |
3 | 10112121012102110000120221 |
4 | 32203111033311003001 |
5 | 112341010041442441 |
6 | 2043222011103041 |
7 | 132151116451462 |
oct | 16432517650301 |
9 | 3477172400527 |
10 | 1000010109121 |
11 | 356113700041 |
12 | 141985441a81 |
13 | 733ba3c7c7a |
14 | 36587918d69 |
15 | 1b02c5b18d1 |
hex | e8d53f50c1 |
1000010109121 has 2 divisors, whose sum is σ = 1000010109122. Its totient is φ = 1000010109120.
The previous prime is 1000010109101. The next prime is 1000010109191. The reversal of 1000010109121 is 1219010100001.
1000010109121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 994617263025 + 5392846096 = 997305^2 + 73436^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000010109121 - 29 = 1000010108609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000010109095 and 1000010109104.
It is not a weakly prime, because it can be changed into another prime (1000010109101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500005054560 + 500005054561.
It is an arithmetic number, because the mean of its divisors is an integer number (500005054561).
Almost surely, 21000010109121 is an apocalyptic number.
It is an amenable number.
1000010109121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000010109121 is an equidigital number, since it uses as much as digits as its factorization.
1000010109121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 1000010109121 its reverse (1219010100001), we get a palindrome (2219020209122).
The spelling of 1000010109121 in words is "one trillion, ten million, one hundred nine thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •