Base | Representation |
---|---|
bin | 10110111101110001100010… |
… | …010111010001010101011011 |
3 | 111020121201002002111222121002 |
4 | 112331301202113101111123 |
5 | 101214304300401401334 |
6 | 554451420313135215 |
7 | 30163106136614402 |
oct | 2675614227212533 |
9 | 436551062458532 |
10 | 101002101200219 |
11 | 2a20082900a97a |
12 | b3b2a733ba50b |
13 | 44485c382ca0b |
14 | 1ad2756338639 |
15 | ba246a738b7e |
hex | 5bdc625d155b |
101002101200219 has 2 divisors, whose sum is σ = 101002101200220. Its totient is φ = 101002101200218.
The previous prime is 101002101200197. The next prime is 101002101200239. The reversal of 101002101200219 is 912002101200101.
It is an a-pointer prime, because the next prime (101002101200239) can be obtained adding 101002101200219 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101002101200219 - 220 = 101002100151643 is a prime.
It is a super-2 number, since 2×1010021012002192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101002101200219.
It is not a weakly prime, because it can be changed into another prime (101002101200239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501050600109 + 50501050600110.
It is an arithmetic number, because the mean of its divisors is an integer number (50501050600110).
Almost surely, 2101002101200219 is an apocalyptic number.
101002101200219 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002101200219 is an equidigital number, since it uses as much as digits as its factorization.
101002101200219 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 101002101200219 in words is "one hundred one trillion, two billion, one hundred one million, two hundred thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •