Base | Representation |
---|---|
bin | 10110111101110001011100… |
… | …111111001011110100111111 |
3 | 111020121200211210210100022221 |
4 | 112331301130333023310333 |
5 | 101214304104304001002 |
6 | 554451403331550211 |
7 | 30163103663126356 |
oct | 2675613477136477 |
9 | 436550753710287 |
10 | 101002011000127 |
11 | 2a200792102246 |
12 | b3b2a4915b367 |
13 | 44485aac3a993 |
14 | 1ad274837899d |
15 | ba246286cc37 |
hex | 5bdc5cfcbd3f |
101002011000127 has 2 divisors, whose sum is σ = 101002011000128. Its totient is φ = 101002011000126.
The previous prime is 101002011000119. The next prime is 101002011000133. The reversal of 101002011000127 is 721000110200101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101002011000127 - 23 = 101002011000119 is a prime.
It is a super-2 number, since 2×1010020110001272 (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 101002011000127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101002011000727) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501005500063 + 50501005500064.
It is an arithmetic number, because the mean of its divisors is an integer number (50501005500064).
Almost surely, 2101002011000127 is an apocalyptic number.
101002011000127 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002011000127 is an equidigital number, since it uses as much as digits as its factorization.
101002011000127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 101002011000127 its reverse (721000110200101), we get a palindrome (822002121200228).
The spelling of 101002011000127 in words is "one hundred one trillion, two billion, eleven million, one hundred twenty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •