Base | Representation |
---|---|
bin | 11001000001000001111110… |
… | …111100101110011000000111 |
3 | 112102120000001012012102121201 |
4 | 121001001332330232120013 |
5 | 103410100040044232101 |
6 | 1025555225315323331 |
7 | 32113554011351512 |
oct | 3101017674563007 |
9 | 472500035172551 |
10 | 110022012102151 |
11 | 32069089622356 |
12 | 1040b0052b0547 |
13 | 495105379ca86 |
14 | 1d25145551d79 |
15 | cabdd1e31e01 |
hex | 64107ef2e607 |
110022012102151 has 2 divisors, whose sum is σ = 110022012102152. Its totient is φ = 110022012102150.
The previous prime is 110022012102109. The next prime is 110022012102203. The reversal of 110022012102151 is 151201210220011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110022012102151 - 215 = 110022012069383 is a prime.
It is a super-2 number, since 2×1100220121021512 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110022012102451) 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, 55011006051075 + 55011006051076.
It is an arithmetic number, because the mean of its divisors is an integer number (55011006051076).
Almost surely, 2110022012102151 is an apocalyptic number.
110022012102151 is a deficient number, since it is larger than the sum of its proper divisors (1).
110022012102151 is an equidigital number, since it uses as much as digits as its factorization.
110022012102151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 19.
Adding to 110022012102151 its reverse (151201210220011), we get a palindrome (261223222322162).
The spelling of 110022012102151 in words is "one hundred ten trillion, twenty-two billion, twelve million, one hundred two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •