Base | Representation |
---|---|
bin | 10110110000111100000001… |
… | …101100001111100000000101 |
3 | 111010111101020201012121112202 |
4 | 112300330001230033200011 |
5 | 101110331240304341401 |
6 | 552534255331124245 |
7 | 30042301131001013 |
oct | 2660740154174005 |
9 | 433441221177482 |
10 | 100120011012101 |
11 | 299a0727102903 |
12 | b28bb19143685 |
13 | 43b33796b7742 |
14 | 1aa1b977c38b3 |
15 | b895406ed06b |
hex | 5b0f01b0f805 |
100120011012101 has 2 divisors, whose sum is σ = 100120011012102. Its totient is φ = 100120011012100.
The previous prime is 100120011012083. The next prime is 100120011012103. The reversal of 100120011012101 is 101210110021001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93417038232001 + 6702972780100 = 9665249^2 + 2589010^2 .
It is a cyclic number.
It is not a de Polignac number, because 100120011012101 - 26 = 100120011012037 is a prime.
Together with 100120011012103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100120011012103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060005506050 + 50060005506051.
It is an arithmetic number, because the mean of its divisors is an integer number (50060005506051).
Almost surely, 2100120011012101 is an apocalyptic number.
It is an amenable number.
100120011012101 is a deficient number, since it is larger than the sum of its proper divisors (1).
100120011012101 is an equidigital number, since it uses as much as digits as its factorization.
100120011012101 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 11.
Adding to 100120011012101 its reverse (101210110021001), we get a palindrome (201330121033102).
The spelling of 100120011012101 in words is "one hundred trillion, one hundred twenty billion, eleven million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •