Base | Representation |
---|---|
bin | 101111000101100111… |
… | …0010001100111011000 |
3 | 100200000020011101222001 |
4 | 1132023032101213120 |
5 | 3124043211214000 |
6 | 114242013010344 |
7 | 10206564004453 |
oct | 1361316214730 |
9 | 320006141861 |
10 | 101120023000 |
11 | 39980686a47 |
12 | 17720a839b4 |
13 | 96c6881149 |
14 | 4c73ad249a |
15 | 296c72846a |
hex | 178b3919d8 |
101120023000 has 64 divisors (see below), whose sum is σ = 236673964800. Its totient is φ = 40438931200.
The previous prime is 101120022979. The next prime is 101120023013. The reversal of 101120023000 is 320021101.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 6080697 + ... + 6097303.
It is an arithmetic number, because the mean of its divisors is an integer number (3698030700).
Almost surely, 2101120023000 is an apocalyptic number.
101120023000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101120023000 is an abundant number, since it is smaller than the sum of its proper divisors (135553941800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120023000 is a wasteful number, since it uses less digits than its factorization.
101120023000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22717 (or 22703 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 101120023000 its reverse (320021101), we get a palindrome (101440044101).
The spelling of 101120023000 in words is "one hundred one billion, one hundred twenty million, twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •