Base | Representation |
---|---|
bin | 10010110111110111… |
… | …01101010010011000 |
3 | 222011010201211202202 |
4 | 21123323231102120 |
5 | 131222333010430 |
6 | 4353230345332 |
7 | 506042145560 |
oct | 113373552230 |
9 | 28133654682 |
10 | 10132313240 |
11 | 432a4769a5 |
12 | 1b6935b248 |
13 | c56235b2a |
14 | 6c1965da0 |
15 | 3e47e6d45 |
hex | 25beed498 |
10132313240 has 64 divisors (see below), whose sum is σ = 26088955200. Its totient is φ = 3469344768.
The previous prime is 10132313197. The next prime is 10132313249. The reversal of 10132313240 is 4231323101.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132313249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191792 + ... + 238848.
It is an arithmetic number, because the mean of its divisors is an integer number (407639925).
Almost surely, 210132313240 is an apocalyptic number.
10132313240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10132313240 is an abundant number, since it is smaller than the sum of its proper divisors (15956641960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10132313240 is a wasteful number, since it uses less digits than its factorization.
10132313240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47844 (or 47840 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 10132313240 its reverse (4231323101), we get a palindrome (14363636341).
The spelling of 10132313240 in words is "ten billion, one hundred thirty-two million, three hundred thirteen thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •