Base | Representation |
---|---|
bin | 10110111101111010110000… |
… | …111110010101111100101001 |
3 | 111020122122122122200011202211 |
4 | 112331322300332111330221 |
5 | 101214440044030001134 |
6 | 554500135441125121 |
7 | 30163606526205112 |
oct | 2675726076257451 |
9 | 436578578604684 |
10 | 101012010000169 |
11 | 2a204a532a3a44 |
12 | b3b49799297a1 |
13 | 4449512667c58 |
14 | 1ad301631b209 |
15 | ba284a5ce764 |
hex | 5bdeb0f95f29 |
101012010000169 has 2 divisors, whose sum is σ = 101012010000170. Its totient is φ = 101012010000168.
The previous prime is 101012010000131. The next prime is 101012010000287. The reversal of 101012010000169 is 961000010210101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100862090032144 + 149919968025 = 10043012^2 + 387195^2 .
It is a cyclic number.
It is not a de Polignac number, because 101012010000169 - 241 = 98812986744617 is a prime.
It is a super-2 number, since 2×1010120100001692 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101012010003169) 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 as a sum of consecutive naturals, namely, 50506005000084 + 50506005000085.
It is an arithmetic number, because the mean of its divisors is an integer number (50506005000085).
Almost surely, 2101012010000169 is an apocalyptic number.
It is an amenable number.
101012010000169 is a deficient number, since it is larger than the sum of its proper divisors (1).
101012010000169 is an equidigital number, since it uses as much as digits as its factorization.
101012010000169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 22.
The spelling of 101012010000169 in words is "one hundred one trillion, twelve billion, ten million, one hundred sixty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •