Base | Representation |
---|---|
bin | 101001111010001101… |
… | …1001000111100001011 |
3 | 22121022021001211211221 |
4 | 1103310123020330023 |
5 | 2433310011214011 |
6 | 105202342302511 |
7 | 6334200144253 |
oct | 1236433107413 |
9 | 277267054757 |
10 | 90000101131 |
11 | 35194790076 |
12 | 15538a27a37 |
13 | 8643b59315 |
14 | 44dad26963 |
15 | 251b39b971 |
hex | 14f46c8f0b |
90000101131 has 2 divisors, whose sum is σ = 90000101132. Its totient is φ = 90000101130.
The previous prime is 90000101083. The next prime is 90000101153. The reversal of 90000101131 is 13110100009.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 90000101131 - 27 = 90000101003 is a prime.
It is a super-2 number, since 2×900001011312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (90000101831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45000050565 + 45000050566.
It is an arithmetic number, because the mean of its divisors is an integer number (45000050566).
Almost surely, 290000101131 is an apocalyptic number.
90000101131 is a deficient number, since it is larger than the sum of its proper divisors (1).
90000101131 is an equidigital number, since it uses as much as digits as its factorization.
90000101131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 16.
The spelling of 90000101131 in words is "ninety billion, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •