Base | Representation |
---|---|
bin | 10111000010100100001001… |
… | …011110000111001010001000 |
3 | 111021210011212002002211202022 |
4 | 113002210021132013022020 |
5 | 101240203022002144422 |
6 | 555302544500024012 |
7 | 30225642426043616 |
oct | 2702441136071210 |
9 | 437704762084668 |
10 | 101331322303112 |
11 | 2a318410813290 |
12 | b446832992008 |
13 | 447066c54bc45 |
14 | 1b046682906b6 |
15 | baacd8467342 |
hex | 5c2909787288 |
101331322303112 has 32 divisors (see below), whose sum is σ = 207269339659200. Its totient is φ = 46059530654400.
The previous prime is 101331322303111. The next prime is 101331322303117. The reversal of 101331322303112 is 211303223133101.
It is not an unprimeable number, because it can be changed into a prime (101331322303111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25354037 + ... + 29077307.
It is an arithmetic number, because the mean of its divisors is an integer number (6477166864350).
Almost surely, 2101331322303112 is an apocalyptic number.
It is an amenable number.
101331322303112 is an abundant number, since it is smaller than the sum of its proper divisors (105938017356088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101331322303112 is a wasteful number, since it uses less digits than its factorization.
101331322303112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4032557 (or 4032553 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 101331322303112 its reverse (211303223133101), we get a palindrome (312634545436213).
The spelling of 101331322303112 in words is "one hundred one trillion, three hundred thirty-one billion, three hundred twenty-two million, three hundred three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •