Base | Representation |
---|---|
bin | 10111000010100100110011… |
… | …110010001100110010011000 |
3 | 111021210020200112220221211112 |
4 | 113002210303302030302120 |
5 | 101240211000221241440 |
6 | 555303143135515452 |
7 | 30225666136135313 |
oct | 2702446362146230 |
9 | 437706615827745 |
10 | 101332032212120 |
11 | 2a318745510446 |
12 | b4469b0688b88 |
13 | 447075364a648 |
14 | 1b046d468797a |
15 | baad2a945965 |
hex | 5c2933c8cc98 |
101332032212120 has 32 divisors (see below), whose sum is σ = 228010748605920. Its totient is φ = 40530381573120.
The previous prime is 101332032212101. The next prime is 101332032212129. The reversal of 101332032212120 is 21212230233101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101332032212129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75303236 + ... + 76637075.
It is an arithmetic number, because the mean of its divisors is an integer number (7125335893935).
Almost surely, 2101332032212120 is an apocalyptic number.
101332032212120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101332032212120 is an abundant number, since it is smaller than the sum of its proper divisors (126678716393800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101332032212120 is a wasteful number, since it uses less digits than its factorization.
101332032212120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151956995 (or 151956991 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 101332032212120 its reverse (21212230233101), we get a palindrome (122544262445221).
The spelling of 101332032212120 in words is "one hundred one trillion, three hundred thirty-two billion, thirty-two million, two hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •