Base | Representation |
---|---|
bin | 1100000011000… |
… | …00101110100000 |
3 | 21001011100120000 |
4 | 12001200232200 |
5 | 201332400423 |
6 | 14010020000 |
7 | 2334664035 |
oct | 601405640 |
9 | 231140500 |
10 | 101059488 |
11 | 52055542 |
12 | 29a17600 |
13 | 17c24b1a |
14 | d5c938c |
15 | 8d13843 |
hex | 6060ba0 |
101059488 has 120 divisors (see below), whose sum is σ = 300529152. Its totient is φ = 33312384.
The previous prime is 101059481. The next prime is 101059523. The reversal of 101059488 is 884950101.
It is a super-2 number, since 2×1010594882 = 20426040229644288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (101059481) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 329031 + ... + 329337.
Almost surely, 2101059488 is an apocalyptic number.
101059488 is a gapful number since it is divisible by the number (18) 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 101059488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150264576).
101059488 is an abundant number, since it is smaller than the sum of its proper divisors (199469664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101059488 is a wasteful number, since it uses less digits than its factorization.
101059488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456 (or 439 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 36.
The square root of 101059488 is about 10052.8348240683. The cubic root of 101059488 is about 465.7923639186.
The spelling of 101059488 in words is "one hundred one million, fifty-nine thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •