Base | Representation |
---|---|
bin | 10111000000101011101101… |
… | …010100111010100000110011 |
3 | 111021022211001110110121121202 |
4 | 113000223231110322200303 |
5 | 101231043144241023331 |
6 | 555123320230041415 |
7 | 30213413634045356 |
oct | 2700535524724063 |
9 | 437284043417552 |
10 | 101202001111091 |
11 | 2a278589329691 |
12 | b4257614a926b |
13 | 44614001a694a |
14 | 1adc2bb00429d |
15 | ba7769edbecb |
hex | 5c0aed53a833 |
101202001111091 has 2 divisors, whose sum is σ = 101202001111092. Its totient is φ = 101202001111090.
The previous prime is 101202001110911. The next prime is 101202001111121. The reversal of 101202001111091 is 190111100202101.
Together with previous prime (101202001110911) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101202001111091 - 214 = 101202001094707 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (101202001111591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50601000555545 + 50601000555546.
It is an arithmetic number, because the mean of its divisors is an integer number (50601000555546).
Almost surely, 2101202001111091 is an apocalyptic number.
101202001111091 is a deficient number, since it is larger than the sum of its proper divisors (1).
101202001111091 is an equidigital number, since it uses as much as digits as its factorization.
101202001111091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
Adding to 101202001111091 its reverse (190111100202101), we get a palindrome (291313101313192).
The spelling of 101202001111091 in words is "one hundred one trillion, two hundred two billion, one million, one hundred eleven thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •