Base | Representation |
---|---|
bin | 10110101111001100001010… |
… | …100101101101100111101000 |
3 | 111010001220020001102112102000 |
4 | 112233030022211231213220 |
5 | 101101344244202223422 |
6 | 552403153113211000 |
7 | 30030516526353060 |
oct | 2657141245554750 |
9 | 433056201375360 |
10 | 99999901211112 |
11 | 299547a1272671 |
12 | b270798700a60 |
13 | 43a4c47837796 |
14 | 1a9a041a583a0 |
15 | b86360ca8cac |
hex | 5af30a96d9e8 |
99999901211112 has 128 divisors (see below), whose sum is σ = 317492634009600. Its totient is φ = 28568463632064.
The previous prime is 99999901211107. The next prime is 99999901211233. The reversal of 99999901211112 is 21111210999999.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a self number, because there is not a number n which added to its sum of digits gives 99999901211112.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11337313 + ... + 18125519.
It is an arithmetic number, because the mean of its divisors is an integer number (2480411203200).
Almost surely, 299999901211112 is an apocalyptic number.
It is an amenable number.
99999901211112 is an abundant number, since it is smaller than the sum of its proper divisors (217492732798488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
99999901211112 is a wasteful number, since it uses less digits than its factorization.
99999901211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6797972 (or 6797962 counting only the distinct ones).
The product of its (nonzero) digits is 2125764, while the sum is 63.
The spelling of 99999901211112 in words is "ninety-nine trillion, nine hundred ninety-nine billion, nine hundred one million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •