Base | Representation |
---|---|
bin | 101111000101101010… |
… | …1110100010010000000 |
3 | 100200000100212211220021 |
4 | 1132023111310102000 |
5 | 3124044213000000 |
6 | 114242123223224 |
7 | 10206616550350 |
oct | 1361325642200 |
9 | 320010784807 |
10 | 101122000000 |
11 | 3998180732a |
12 | 17721677b14 |
13 | 96c70c3c78 |
14 | 4c74088b60 |
15 | 296c9b911a |
hex | 178b574480 |
101122000000 has 448 divisors, whose sum is σ = 298346181120. Its totient is φ = 33408000000.
The previous prime is 101121999971. The next prime is 101122000097. The reversal of 101122000000 is 221101.
It is a tau number, because it is divible by the number of its divisors (448).
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 433999884 + ... + 434000116.
Almost surely, 2101122000000 is an apocalyptic number.
101122000000 is a gapful number since it is divisible by the number (10) 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 101122000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149173090560).
101122000000 is an abundant number, since it is smaller than the sum of its proper divisors (197224181120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101122000000 is an frugal number, since it uses more digits than its factorization.
101122000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 315 (or 278 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 101122000000 its reverse (221101), we get a palindrome (101122221101).
The spelling of 101122000000 in words is "one hundred one billion, one hundred twenty-two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •