Base | Representation |
---|---|
bin | 101111000110000000… |
… | …0100010110000010000 |
3 | 100200001010221212221220 |
4 | 1132030000202300100 |
5 | 3124110044403100 |
6 | 114243203245040 |
7 | 10210114006521 |
oct | 1361400426020 |
9 | 320033855856 |
10 | 101133200400 |
11 | 39988067361 |
12 | 17725379780 |
13 | 96c951601b |
14 | 4c75762848 |
15 | 296d97caa0 |
hex | 178c022c10 |
101133200400 has 120 divisors (see below), whose sum is σ = 324048277440. Its totient is φ = 26961784320.
The previous prime is 101133200369. The next prime is 101133200453. The reversal of 101133200400 is 4002331101.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101133200400.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5875006 + ... + 5892194.
It is an arithmetic number, because the mean of its divisors is an integer number (2700402312).
Almost surely, 2101133200400 is an apocalyptic number.
101133200400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101133200400 is an abundant number, since it is smaller than the sum of its proper divisors (222915077040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101133200400 is a wasteful number, since it uses less digits than its factorization.
101133200400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22113 (or 22102 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 101133200400 its reverse (4002331101), we get a palindrome (105135531501).
The spelling of 101133200400 in words is "one hundred one billion, one hundred thirty-three million, two hundred thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •