Base | Representation |
---|---|
bin | 10010110100000100… |
… | …00111110001011000 |
3 | 222001220202112010000 |
4 | 21122002013301120 |
5 | 131141203041102 |
6 | 4350131253000 |
7 | 505204216245 |
oct | 113202076130 |
9 | 28056675100 |
10 | 10100440152 |
11 | 4313487200 |
12 | 1b5a74a160 |
13 | c4c75640a |
14 | 6bb62a5cc |
15 | 3e1aed01c |
hex | 25a087c58 |
10100440152 has 120 divisors (see below), whose sum is σ = 31096503900. Its totient is φ = 3060715680.
The previous prime is 10100440117. The next prime is 10100440157. The reversal of 10100440152 is 25104400101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100440157) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 13999 + ... + 142817.
Almost surely, 210100440152 is an apocalyptic number.
10100440152 is a gapful number since it is divisible by the number (12) 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 10100440152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15548251950).
10100440152 is an abundant number, since it is smaller than the sum of its proper divisors (20996063748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100440152 is a wasteful number, since it uses less digits than its factorization.
10100440152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128859 (or 128835 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 10100440152 its reverse (25104400101), we get a palindrome (35204840253).
The spelling of 10100440152 in words is "ten billion, one hundred million, four hundred forty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •