Base | Representation |
---|---|
bin | 10011100111011011… |
… | …10101110000110101 |
3 | 1000011221120001101221 |
4 | 21303231311300311 |
5 | 133032010044000 |
6 | 4501002550341 |
7 | 521655560200 |
oct | 116355656065 |
9 | 30157501357 |
10 | 10531331125 |
11 | 4514730a47 |
12 | 205ab083b1 |
13 | cbaac23a3 |
14 | 71c952937 |
15 | 41986461a |
hex | 273b75c35 |
10531331125 has 48 divisors (see below), whose sum is σ = 15614636544. Its totient is φ = 7067642400.
The previous prime is 10531331123. The next prime is 10531331141. The reversal of 10531331125 is 52113313501.
It is not a de Polignac number, because 10531331125 - 21 = 10531331123 is a prime.
It is a super-2 number, since 2×105313311252 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10531331125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10531331123) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 269584 + ... + 306166.
It is an arithmetic number, because the mean of its divisors is an integer number (325304928).
Almost surely, 210531331125 is an apocalyptic number.
It is an amenable number.
10531331125 is a deficient number, since it is larger than the sum of its proper divisors (5083305419).
10531331125 is an equidigital number, since it uses as much as digits as its factorization.
10531331125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36659 (or 36642 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 25.
Adding to 10531331125 its reverse (52113313501), we get a palindrome (62644644626).
The spelling of 10531331125 in words is "ten billion, five hundred thirty-one million, three hundred thirty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •