Base | Representation |
---|---|
bin | 1100000011011… |
… | …11100110110000 |
3 | 21001021110011012 |
4 | 12001233212300 |
5 | 201341323212 |
6 | 14011210052 |
7 | 2335336520 |
oct | 601574660 |
9 | 231243135 |
10 | 101120432 |
11 | 52097306 |
12 | 29a46928 |
13 | 17c4679a |
14 | d603680 |
15 | 8d26922 |
hex | 606f9b0 |
101120432 has 120 divisors (see below), whose sum is σ = 246046752. Its totient is φ = 39398400.
The previous prime is 101120431. The next prime is 101120479. The reversal of 101120432 is 234021101.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (101120431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1657682 + ... + 1657742.
Almost surely, 2101120432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101120432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123023376).
101120432 is an abundant number, since it is smaller than the sum of its proper divisors (144926320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120432 is a wasteful number, since it uses less digits than its factorization.
101120432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155 (or 130 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 101120432 is about 10055.8655520050. The cubic root of 101120432 is about 465.8859772480.
Adding to 101120432 its reverse (234021101), we get a palindrome (335141533).
The spelling of 101120432 in words is "one hundred one million, one hundred twenty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •