Base | Representation |
---|---|
bin | 101111000101100111… |
… | …0100100101001111110 |
3 | 100200000020022100221120 |
4 | 1132023032210221332 |
5 | 3124043221212430 |
6 | 114242014411410 |
7 | 10206564451026 |
oct | 1361316445176 |
9 | 320006270846 |
10 | 101120100990 |
11 | 3998072a5a7 |
12 | 17720b00b66 |
13 | 96c68aa7ac |
14 | 4c73b12a86 |
15 | 296c741610 |
hex | 178b3a4a7e |
101120100990 has 96 divisors (see below), whose sum is σ = 256552803360. Its totient is φ = 25502788608.
The previous prime is 101120100947. The next prime is 101120101009. The reversal of 101120100990 is 99001021101.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101120100990.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1376634 + ... + 1448226.
It is an arithmetic number, because the mean of its divisors is an integer number (2672425035).
Almost surely, 2101120100990 is an apocalyptic number.
101120100990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101120100990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128276401680).
101120100990 is an abundant number, since it is smaller than the sum of its proper divisors (155432702370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120100990 is a wasteful number, since it uses less digits than its factorization.
101120100990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71738 (or 71715 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 24.
The spelling of 101120100990 in words is "one hundred one billion, one hundred twenty million, one hundred thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •