Base | Representation |
---|---|
bin | 1100000010111… |
… | …10100000100000 |
3 | 21001010220002102 |
4 | 12001132200200 |
5 | 201332103100 |
6 | 14005505532 |
7 | 2334625403 |
oct | 601364040 |
9 | 231126072 |
10 | 101050400 |
11 | 52049730 |
12 | 29a122a8 |
13 | 17c20949 |
14 | d5c5d3a |
15 | 8d10cd5 |
hex | 605e820 |
101050400 has 72 divisors (see below), whose sum is σ = 269139024. Its totient is φ = 36742400.
The previous prime is 101050393. The next prime is 101050427. The reversal of 101050400 is 4050101.
It is a super-2 number, since 2×1010504002 = 20422366680320000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (11).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3059 + ... + 14541.
It is an arithmetic number, because the mean of its divisors is an integer number (3738042).
Almost surely, 2101050400 is an apocalyptic number.
101050400 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 101050400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134569512).
101050400 is an abundant number, since it is smaller than the sum of its proper divisors (168088624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101050400 is a wasteful number, since it uses less digits than its factorization.
101050400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11514 (or 11501 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 11.
The square root of 101050400 is about 10052.3828021022. The cubic root of 101050400 is about 465.7784010274.
The spelling of 101050400 in words is "one hundred one million, fifty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •