Base | Representation |
---|---|
bin | 1001001000111111001110… |
… | …10010010101101000110011 |
3 | 2122011112200210220222111020 |
4 | 10210133213102111220303 |
5 | 10113304331233301344 |
6 | 110425454413550523 |
7 | 4143115352516622 |
oct | 444374722255063 |
9 | 78145623828436 |
10 | 20100032322099 |
11 | 644a41526a214 |
12 | 23076301a5443 |
13 | b2a56a6cc382 |
14 | 4d6bbd6d36b9 |
15 | 24ccabd57719 |
hex | 1247e7495a33 |
20100032322099 has 24 divisors (see below), whose sum is σ = 27756671517120. Its totient is φ = 12937661849952.
The previous prime is 20100032322061. The next prime is 20100032322107. The reversal of 20100032322099 is 99022323000102.
It is not a de Polignac number, because 20100032322099 - 28 = 20100032321843 is a prime.
It is a super-2 number, since 2×201000323220992 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20100032322049) 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 23 ways as a sum of consecutive naturals, for example, 219725232 + ... + 219816690.
It is an arithmetic number, because the mean of its divisors is an integer number (1156527979880).
Almost surely, 220100032322099 is an apocalyptic number.
20100032322099 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
20100032322099 is a deficient number, since it is larger than the sum of its proper divisors (7656639195021).
20100032322099 is an equidigital number, since it uses as much as digits as its factorization.
20100032322099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178627 (or 178598 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 33.
The spelling of 20100032322099 in words is "twenty trillion, one hundred billion, thirty-two million, three hundred twenty-two thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •