Base | Representation |
---|---|
bin | 10110100000110100001110… |
… | …010011101010100111011001 |
3 | 110222120110120221220100012202 |
4 | 112200310032103222213121 |
5 | 100434203311001023001 |
6 | 550325312425415545 |
7 | 26566250443136240 |
oct | 2640641623524731 |
9 | 428513527810182 |
10 | 99012121111001 |
11 | 2960389414339a |
12 | b13126703a5b5 |
13 | 4332a59137747 |
14 | 1a642d8511957 |
15 | b6a7ec24d96b |
hex | 5a0d0e4ea9d9 |
99012121111001 has 16 divisors (see below), whose sum is σ = 114920046879744. Its totient is φ = 83546671461264.
The previous prime is 99012121110899. The next prime is 99012121111009. The reversal of 99012121111001 is 10011112121099.
It is a cyclic number.
It is not a de Polignac number, because 99012121111001 - 214 = 99012121094617 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (99012121111009) 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 in 15 ways as a sum of consecutive naturals, for example, 67686335 + ... + 69133668.
It is an arithmetic number, because the mean of its divisors is an integer number (7182502929984).
Almost surely, 299012121111001 is an apocalyptic number.
It is an amenable number.
99012121111001 is a deficient number, since it is larger than the sum of its proper divisors (15907925768743).
99012121111001 is a wasteful number, since it uses less digits than its factorization.
99012121111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136821620.
The product of its (nonzero) digits is 324, while the sum is 29.
The spelling of 99012121111001 in words is "ninety-nine trillion, twelve billion, one hundred twenty-one million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •