Base | Representation |
---|---|
bin | 10111000010100100111111… |
… | …000010101111111111101100 |
3 | 111021210021011201100110022101 |
4 | 113002210333002233333230 |
5 | 101240211342100200022 |
6 | 555303214004224444 |
7 | 30226003621512010 |
oct | 2702447702577754 |
9 | 437707151313271 |
10 | 101332221100012 |
11 | 2a3188320a3741 |
12 | b446a4399b124 |
13 | 4470783813b26 |
14 | 1b047117b6540 |
15 | baad3c307627 |
hex | 5c293f0affec |
101332221100012 has 96 divisors (see below), whose sum is σ = 217495236381696. Its totient is φ = 40322047795200.
The previous prime is 101332221100001. The next prime is 101332221100021. The reversal of 101332221100012 is 210001122233101.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10831087 + ... + 17887897.
It is an arithmetic number, because the mean of its divisors is an integer number (2265575378976).
Almost surely, 2101332221100012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101332221100012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108747618190848).
101332221100012 is an abundant number, since it is smaller than the sum of its proper divisors (116163015281684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101332221100012 is a wasteful number, since it uses less digits than its factorization.
101332221100012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7057247 (or 7057245 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 101332221100012 its reverse (210001122233101), we get a palindrome (311333343333113).
The spelling of 101332221100012 in words is "one hundred one trillion, three hundred thirty-two billion, two hundred twenty-one million, one hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •