Base | Representation |
---|---|
bin | 1100000100100… |
… | …10101010000000 |
3 | 21001112202002112 |
4 | 12002102222000 |
5 | 201410422000 |
6 | 14014234452 |
7 | 2336505215 |
oct | 602225200 |
9 | 231482075 |
10 | 101264000 |
11 | 52185162 |
12 | 29ab5a28 |
13 | 17c96c36 |
14 | d63db0c |
15 | 8d54235 |
hex | 6092a80 |
101264000 has 64 divisors (see below), whose sum is σ = 251807400. Its totient is φ = 40499200.
The previous prime is 101263999. The next prime is 101264003. The reversal of 101264000 is 462101.
It can be written as a sum of positive squares in 4 ways, for example, as 43138624 + 58125376 = 6568^2 + 7624^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (101264003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12836 + ... + 19164.
Almost surely, 2101264000 is an apocalyptic number.
101264000 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 101264000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125903700).
101264000 is an abundant number, since it is smaller than the sum of its proper divisors (150543400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101264000 is an frugal number, since it uses more digits than its factorization.
101264000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6358 (or 6336 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 101264000 is about 10063.0015402960. The cubic root of 101264000 is about 466.1063570043.
The spelling of 101264000 in words is "one hundred one million, two hundred sixty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •