Base | Representation |
---|---|
bin | 10110111101110001100010… |
… | …011010110001111100001001 |
3 | 111020121201002011020201120111 |
4 | 112331301202122301330021 |
5 | 101214304301120321301 |
6 | 554451420344554321 |
7 | 30163106150465512 |
oct | 2675614232617411 |
9 | 436551064221514 |
10 | 101002102120201 |
11 | 2a200829589097 |
12 | b3b2a737829a1 |
13 | 44485c3a92699 |
14 | 1ad27564d7a09 |
15 | ba246a86b551 |
hex | 5bdc626b1f09 |
101002102120201 has 2 divisors, whose sum is σ = 101002102120202. Its totient is φ = 101002102120200.
The previous prime is 101002102120169. The next prime is 101002102120259. The reversal of 101002102120201 is 102021201200101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81904328110201 + 19097774010000 = 9050101^2 + 4370100^2 .
It is a cyclic number.
It is not a de Polignac number, because 101002102120201 - 25 = 101002102120169 is a prime.
It is a super-2 number, since 2×1010021021202012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101002102120261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501051060100 + 50501051060101.
It is an arithmetic number, because the mean of its divisors is an integer number (50501051060101).
Almost surely, 2101002102120201 is an apocalyptic number.
It is an amenable number.
101002102120201 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002102120201 is an equidigital number, since it uses as much as digits as its factorization.
101002102120201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101002102120201 its reverse (102021201200101), we get a palindrome (203023303320302).
The spelling of 101002102120201 in words is "one hundred one trillion, two billion, one hundred two million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •