Base | Representation |
---|---|
bin | 101111000101101111… |
… | …0101000100010100000 |
3 | 100200000112020021021021 |
4 | 1132023132220202200 |
5 | 3124100310424300 |
6 | 114242244535224 |
7 | 10206645314503 |
oct | 1361336504240 |
9 | 320015207237 |
10 | 101124311200 |
11 | 39983045810 |
12 | 177223b1514 |
13 | 96c7722c43 |
14 | 4c744cb13a |
15 | 296ccc3d1a |
hex | 178b7a88a0 |
101124311200 has 72 divisors (see below), whose sum is σ = 269312450400. Its totient is φ = 36772473600.
The previous prime is 101124311149. The next prime is 101124311231. The reversal of 101124311200 is 2113421101.
It is a super-2 number, since 2×1011243112002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5736900 + ... + 5754499.
It is an arithmetic number, because the mean of its divisors is an integer number (3740450700).
Almost surely, 2101124311200 is an apocalyptic number.
101124311200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101124311200 is an abundant number, since it is smaller than the sum of its proper divisors (168188139200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101124311200 is a wasteful number, since it uses less digits than its factorization.
101124311200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11491430 (or 11491417 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 101124311200 its reverse (2113421101), we get a palindrome (103237732301).
The spelling of 101124311200 in words is "one hundred one billion, one hundred twenty-four million, three hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •