Base | Representation |
---|---|
bin | 101111000101011110… |
… | …1000111000101000000 |
3 | 100122222220200210122220 |
4 | 1132022331013011000 |
5 | 3124041033222032 |
6 | 114241332331040 |
7 | 10206510524202 |
oct | 1361275070500 |
9 | 318886623586 |
10 | 101115523392 |
11 | 39979093364 |
12 | 1771b473a80 |
13 | 96c5967060 |
14 | 4c73280772 |
15 | 296c13a12c |
hex | 178af47140 |
101115523392 has 448 divisors, whose sum is σ = 309696307200. Its totient is φ = 28877561856.
The previous prime is 101115523381. The next prime is 101115523459. The reversal of 101115523392 is 293325511101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 508118109 + ... + 508118307.
It is an arithmetic number, because the mean of its divisors is an integer number (691286400).
Almost surely, 2101115523392 is an apocalyptic number.
101115523392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101115523392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154848153600).
101115523392 is an abundant number, since it is smaller than the sum of its proper divisors (208580783808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101115523392 is a wasteful number, since it uses less digits than its factorization.
101115523392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470 (or 460 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 33.
The spelling of 101115523392 in words is "one hundred one billion, one hundred fifteen million, five hundred twenty-three thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •