Base | Representation |
---|---|
bin | 101111001010100011… |
… | …1010000011000000000 |
3 | 100200102210101121222100 |
4 | 1132111013100120000 |
5 | 3124413201030242 |
6 | 114310301310400 |
7 | 10213650261441 |
oct | 1362507203000 |
9 | 320383347870 |
10 | 101285955072 |
11 | 39a56310195 |
12 | 17768565400 |
13 | 972206a9c3 |
14 | 4c8bb672c8 |
15 | 297c0a354c |
hex | 17951d0600 |
101285955072 has 120 divisors (see below), whose sum is σ = 293935561920. Its totient is φ = 33575178240.
The previous prime is 101285955049. The next prime is 101285955097. The reversal of 101285955072 is 270559582101.
101285955072 is a `hidden beast` number, since 1 + 0 + 1 + 2 + 8 + 595 + 50 + 7 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 773329 + ... + 894767.
It is an arithmetic number, because the mean of its divisors is an integer number (2449463016).
Almost surely, 2101285955072 is an apocalyptic number.
101285955072 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 101285955072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146967780960).
101285955072 is an abundant number, since it is smaller than the sum of its proper divisors (192649606848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101285955072 is a wasteful number, since it uses less digits than its factorization.
101285955072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121644 (or 121625 counting only the distinct ones).
The product of its (nonzero) digits is 252000, while the sum is 45.
The spelling of 101285955072 in words is "one hundred one billion, two hundred eighty-five million, nine hundred fifty-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •