Base | Representation |
---|---|
bin | 101110000110111000… |
… | …1011110010100111011 |
3 | 100110120112210110110002 |
4 | 1130031301132110323 |
5 | 3110240410232031 |
6 | 113253105543215 |
7 | 10103456224634 |
oct | 1341561362473 |
9 | 313515713402 |
10 | 99015320891 |
11 | 38aa0627113 |
12 | 17234044b0b |
13 | 944c807c96 |
14 | 4b1438088b |
15 | 2897a82ccb |
hex | 170dc5e53b |
99015320891 has 2 divisors, whose sum is σ = 99015320892. Its totient is φ = 99015320890.
The previous prime is 99015320821. The next prime is 99015320893. The reversal of 99015320891 is 19802351099.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 99015320891 - 230 = 97941579067 is a prime.
It is a super-2 number, since 2×990153208912 (a number of 23 digits) contains 22 as substring.
Together with 99015320893, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (99015320893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 49507660445 + 49507660446.
It is an arithmetic number, because the mean of its divisors is an integer number (49507660446).
Almost surely, 299015320891 is an apocalyptic number.
99015320891 is a deficient number, since it is larger than the sum of its proper divisors (1).
99015320891 is an equidigital number, since it uses as much as digits as its factorization.
99015320891 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 47.
The spelling of 99015320891 in words is "ninety-nine billion, fifteen million, three hundred twenty thousand, eight hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •