Base | Representation |
---|---|
bin | 1001101111100110… |
… | …00100010010110110 |
3 | 111111120020110200120 |
4 | 10313303010102312 |
5 | 41203130213420 |
6 | 2223024352410 |
7 | 243426424434 |
oct | 46763042266 |
9 | 14446213616 |
10 | 5231101110 |
11 | 2244902764 |
12 | 101ba75706 |
13 | 6549b5101 |
14 | 378a5bd54 |
15 | 2093a5d40 |
hex | 137cc44b6 |
5231101110 has 32 divisors (see below), whose sum is σ = 13293152352. Its totient is φ = 1312903680.
The previous prime is 5231101097. The next prime is 5231101111. The reversal of 5231101110 is 111011325.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 5231101110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5231101111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5128021 + ... + 5129040.
It is an arithmetic number, because the mean of its divisors is an integer number (415411011).
Almost surely, 25231101110 is an apocalyptic number.
5231101110 is an abundant number, since it is smaller than the sum of its proper divisors (8062051242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5231101110 is a wasteful number, since it uses less digits than its factorization.
5231101110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10257088.
The product of its (nonzero) digits is 30, while the sum is 15.
The square root of 5231101110 is about 72326.3514218711. The cubic root of 5231101110 is about 1735.9253214830.
Adding to 5231101110 its reverse (111011325), we get a palindrome (5342112435).
The spelling of 5231101110 in words is "five billion, two hundred thirty-one million, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •