Base | Representation |
---|---|
bin | 10000110001000001… |
… | …00011000100011111 |
3 | 212020022012021101222 |
4 | 20120200203010133 |
5 | 121413241320111 |
6 | 4045101123555 |
7 | 436025154311 |
oct | 103040430437 |
9 | 25208167358 |
10 | 9001120031 |
11 | 38a9996782 |
12 | 18b25595bb |
13 | b05a83037 |
14 | 6156277b1 |
15 | 37a34d7db |
hex | 21882311f |
9001120031 has 2 divisors, whose sum is σ = 9001120032. Its totient is φ = 9001120030.
The previous prime is 9001120027. The next prime is 9001120043. The reversal of 9001120031 is 1300211009.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1300211009) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 9001120031 - 22 = 9001120027 is a prime.
It is a super-2 number, since 2×90011200312 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 9001119991 and 9001120009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9001120631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4500560015 + 4500560016.
It is an arithmetic number, because the mean of its divisors is an integer number (4500560016).
Almost surely, 29001120031 is an apocalyptic number.
9001120031 is a deficient number, since it is larger than the sum of its proper divisors (1).
9001120031 is an equidigital number, since it uses as much as digits as its factorization.
9001120031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
The square root of 9001120031 is about 94874.2327030896. The cubic root of 9001120031 is about 2080.1701068196.
The spelling of 9001120031 in words is "nine billion, one million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •