Base | Representation |
---|---|
bin | 10111000010100100000010… |
… | …010011010001011011110000 |
3 | 111021210011112200202212212010 |
4 | 113002210002103101123300 |
5 | 101240202300204133404 |
6 | 555302524522002520 |
7 | 30225636435466326 |
oct | 2702440223213360 |
9 | 437704480685763 |
10 | 101331202021104 |
11 | 2a318359929670 |
12 | b4467ba646440 |
13 | 4470650656863 |
14 | 1b046562ddd16 |
15 | baacccb08189 |
hex | 5c29024d16f0 |
101331202021104 has 80 divisors (see below), whose sum is σ = 286251302494080. Its totient is φ = 30633139764480.
The previous prime is 101331202021009. The next prime is 101331202021129. The reversal of 101331202021104 is 401120202133101.
It is a super-2 number, since 2×1013312020211042 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 228794467 + ... + 229236930.
It is an arithmetic number, because the mean of its divisors is an integer number (3578141281176).
Almost surely, 2101331202021104 is an apocalyptic number.
It is an amenable number.
101331202021104 is an abundant number, since it is smaller than the sum of its proper divisors (184920100472976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101331202021104 is a wasteful number, since it uses less digits than its factorization.
101331202021104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458031838 (or 458031832 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 101331202021104 its reverse (401120202133101), we get a palindrome (502451404154205).
The spelling of 101331202021104 in words is "one hundred one trillion, three hundred thirty-one billion, two hundred two million, twenty-one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •