Base | Representation |
---|---|
bin | 10010110110100001… |
… | …11110001010001000 |
3 | 222010100122200000120 |
4 | 21123100332022020 |
5 | 131212001011102 |
6 | 4352150303240 |
7 | 505545005526 |
oct | 113320761210 |
9 | 28110580016 |
10 | 10121110152 |
11 | 432411494a |
12 | 1b65657b20 |
13 | c53b1279a |
14 | 6c028b316 |
15 | 3e38326bc |
hex | 25b43e288 |
10121110152 has 64 divisors (see below), whose sum is σ = 26694360000. Its totient is φ = 3188957184.
The previous prime is 10121110151. The next prime is 10121110163. The reversal of 10121110152 is 25101112101.
It is not an unprimeable number, because it can be changed into a prime (10121110151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 180028 + ... + 229460.
It is an arithmetic number, because the mean of its divisors is an integer number (417099375).
Almost surely, 210121110152 is an apocalyptic number.
10121110152 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 10121110152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13347180000).
10121110152 is an abundant number, since it is smaller than the sum of its proper divisors (16573249848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10121110152 is a wasteful number, since it uses less digits than its factorization.
10121110152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49910 (or 49906 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 15.
Adding to 10121110152 its reverse (25101112101), we get a palindrome (35222222253).
The spelling of 10121110152 in words is "ten billion, one hundred twenty-one million, one hundred ten thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •