Base | Representation |
---|---|
bin | 101101101101000101001001… |
… | …101101001101110111001001 |
3 | 222100201100221120201102210201 |
4 | 231231011021231031313021 |
5 | 202321321440224310441 |
6 | 1551302415240212201 |
7 | 60224331132253462 |
oct | 5555051155156711 |
9 | 870640846642721 |
10 | 201010001010121 |
11 | 59058954283166 |
12 | 1a66510276a061 |
13 | 8821214509894 |
14 | 378cd163b3d69 |
15 | 1838ae8812c31 |
hex | b6d149b4ddc9 |
201010001010121 has 2 divisors, whose sum is σ = 201010001010122. Its totient is φ = 201010001010120.
The previous prime is 201010001010059. The next prime is 201010001010167. The reversal of 201010001010121 is 121010100010102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 152418506032521 + 48591494977600 = 12345789^2 + 6970760^2 .
It is a cyclic number.
It is not a de Polignac number, because 201010001010121 - 227 = 201009866792393 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201010001010098 and 201010001010107.
It is not a weakly prime, because it can be changed into another prime (201010001011121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505000505060 + 100505000505061.
It is an arithmetic number, because the mean of its divisors is an integer number (100505000505061).
Almost surely, 2201010001010121 is an apocalyptic number.
It is an amenable number.
201010001010121 is a deficient number, since it is larger than the sum of its proper divisors (1).
201010001010121 is an equidigital number, since it uses as much as digits as its factorization.
201010001010121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 201010001010121 its reverse (121010100010102), we get a palindrome (322020101020223).
The spelling of 201010001010121 in words is "two hundred one trillion, ten billion, one million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •