| Base | Representation |
|---|---|
| bin | 101111000101100111… |
| … | …0001100001111101000 |
| 3 | 100200000020010021210020 |
| 4 | 1132023032030033220 |
| 5 | 3124043210013000 |
| 6 | 114242012320440 |
| 7 | 10206563553354 |
| oct | 1361316141750 |
| 9 | 320006107706 |
| 10 | 101120001000 |
| 11 | 39980671467 |
| 12 | 17720a73120 |
| 13 | 96c6874125 |
| 14 | 4c73ac8464 |
| 15 | 296c721ba0 |
| hex | 178b38c3e8 |
101120001000 has 256 divisors, whose sum is σ = 324704540160. Its totient is φ = 26181273600.
The previous prime is 101120000981. The next prime is 101120001019. The reversal of 101120001000 is 100021101.
It is an interprime number because it is at equal distance from previous prime (101120000981) and next prime (101120001019).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 101120001000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 95126469 + ... + 95127531.
It is an arithmetic number, because the mean of its divisors is an integer number (1268377110).
Almost surely, 2101120001000 is an apocalyptic number.
101120001000 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 101120001000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162352270080).
101120001000 is an abundant number, since it is smaller than the sum of its proper divisors (223584539160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120001000 is a wasteful number, since it uses less digits than its factorization.
101120001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1981 (or 1967 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 101120001000 its reverse (100021101), we get a palindrome (101220022101).
The spelling of 101120001000 in words is "one hundred one billion, one hundred twenty million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •