Base | Representation |
---|---|
bin | 1001001001111010111101… |
… | …01111000110100000110100 |
3 | 2122021121110202000210221121 |
4 | 10210331132233012200310 |
5 | 10114321020341401400 |
6 | 110452320511353324 |
7 | 4145332143025432 |
oct | 444753657064064 |
9 | 78247422023847 |
10 | 20132101122100 |
11 | 6461a81271310 |
12 | 231189bb22844 |
13 | b305ab57a086 |
14 | 4d85827c5d52 |
15 | 24da373d421a |
hex | 124f5ebc6834 |
20132101122100 has 72 divisors (see below), whose sum is σ = 47669024174688. Its totient is φ = 7319097340800.
The previous prime is 20132101122061. The next prime is 20132101122151. The reversal of 20132101122100 is 122110123102.
It is a congruent number.
It is an unprimeable number.
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, 2755519 + ... + 6917881.
It is an arithmetic number, because the mean of its divisors is an integer number (662069780204).
Almost surely, 220132101122100 is an apocalyptic number.
20132101122100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20132101122100 is an abundant number, since it is smaller than the sum of its proper divisors (27536923052588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20132101122100 is a wasteful number, since it uses less digits than its factorization.
20132101122100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4166785 (or 4166778 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 20132101122100 its reverse (122110123102), we get a palindrome (20254211245202).
The spelling of 20132101122100 in words is "twenty trillion, one hundred thirty-two billion, one hundred one million, one hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •