Base | Representation |
---|---|
bin | 10110101111011000011001… |
… | …010000011101101100100111 |
3 | 111010010011010011200221012210 |
4 | 112233120121100131230213 |
5 | 101102103142220412444 |
6 | 552413204104014503 |
7 | 30031463113053321 |
oct | 2657303120355447 |
9 | 433104104627183 |
10 | 100013032200999 |
11 | 2995a31a385725 |
12 | b273242161433 |
13 | 43a625b0b0698 |
14 | 1a9a929960611 |
15 | b8687d9827b9 |
hex | 5af61941db27 |
100013032200999 has 16 divisors (see below), whose sum is σ = 133476385912704. Its totient is φ = 66612541831200.
The previous prime is 100013032200989. The next prime is 100013032201111. The reversal of 100013032200999 is 999002230310001.
It is not a de Polignac number, because 100013032200999 - 25 = 100013032200967 is a prime.
It is a super-2 number, since 2×1000130322009992 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100013032200929) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12750592 + ... + 19042154.
It is an arithmetic number, because the mean of its divisors is an integer number (8342274119544).
Almost surely, 2100013032200999 is an apocalyptic number.
100013032200999 is a deficient number, since it is larger than the sum of its proper divisors (33463353711705).
100013032200999 is a wasteful number, since it uses less digits than its factorization.
100013032200999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6296558.
The product of its (nonzero) digits is 26244, while the sum is 39.
The spelling of 100013032200999 in words is "one hundred trillion, thirteen billion, thirty-two million, two hundred thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •