Base | Representation |
---|---|
bin | 101011111000101000… |
… | …111001101010111110 |
3 | 11111121221202011022110 |
4 | 223320220321222332 |
5 | 1233001003111020 |
6 | 33351441354450 |
7 | 3255464056026 |
oct | 537050715276 |
9 | 144557664273 |
10 | 47121144510 |
11 | 18a90726340 |
12 | 9170938a26 |
13 | 459c4c333b |
14 | 23d0260a86 |
15 | 135bc808e0 |
hex | af8a39abe |
47121144510 has 256 divisors, whose sum is σ = 134407848960. Its totient is φ = 10443202560.
The previous prime is 47121144449. The next prime is 47121144571. The reversal of 47121144510 is 1544112174.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (47121144449) and next prime (47121144571).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 55241244 + ... + 55242096.
It is an arithmetic number, because the mean of its divisors is an integer number (525030660).
Almost surely, 247121144510 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 47121144510, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67203924480).
47121144510 is an abundant number, since it is smaller than the sum of its proper divisors (87286704450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47121144510 is a wasteful number, since it uses less digits than its factorization.
47121144510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1163.
The product of its (nonzero) digits is 4480, while the sum is 30.
Adding to 47121144510 its reverse (1544112174), we get a palindrome (48665256684).
The spelling of 47121144510 in words is "forty-seven billion, one hundred twenty-one million, one hundred forty-four thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •