Base | Representation |
---|---|
bin | 10111000010011010101000… |
… | …111101111001011110000110 |
3 | 111021202012111121002022111102 |
4 | 113002122220331321132012 |
5 | 101240021120001423420 |
6 | 555254135445540102 |
7 | 30225131433043550 |
oct | 2702325075713606 |
9 | 437665447068442 |
10 | 101321113311110 |
11 | 2a314052034510 |
12 | b444863a14632 |
13 | 446c703479684 |
14 | 1b03d7a4884d0 |
15 | baa8dc075a75 |
hex | 5c26a8f79786 |
101321113311110 has 64 divisors (see below), whose sum is σ = 227394374699520. Its totient is φ = 31578661451520.
The previous prime is 101321113311049. The next prime is 101321113311133. The reversal of 101321113311110 is 11113311123101.
It is a congruent number.
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, 8481026 + ... + 16570154.
It is an arithmetic number, because the mean of its divisors is an integer number (3553037104680).
Almost surely, 2101321113311110 is an apocalyptic number.
101321113311110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101321113311110 is an abundant number, since it is smaller than the sum of its proper divisors (126073261388410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101321113311110 is a wasteful number, since it uses less digits than its factorization.
101321113311110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8105421.
The product of its (nonzero) digits is 54, while the sum is 20.
Adding to 101321113311110 its reverse (11113311123101), we get a palindrome (112434424434211).
The spelling of 101321113311110 in words is "one hundred one trillion, three hundred twenty-one billion, one hundred thirteen million, three hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •