Base | Representation |
---|---|
bin | 10010110111101111… |
… | …11000101000011010 |
3 | 222011001211221010120 |
4 | 21123313320220122 |
5 | 131222103424010 |
6 | 4353153054110 |
7 | 506030503143 |
oct | 113367705032 |
9 | 28131757116 |
10 | 10131311130 |
11 | 4329952006 |
12 | 1b68b57336 |
13 | c55c74975 |
14 | 6c1784aca |
15 | 3e4699e70 |
hex | 25bdf8a1a |
10131311130 has 16 divisors (see below), whose sum is σ = 24315146784. Its totient is φ = 2701682960.
The previous prime is 10131311053. The next prime is 10131311131. The reversal of 10131311130 is 3111313101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (10131311131) 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 7 ways as a sum of consecutive naturals, for example, 168855156 + ... + 168855215.
It is an arithmetic number, because the mean of its divisors is an integer number (1519696674).
Almost surely, 210131311130 is an apocalyptic number.
10131311130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10131311130 is an abundant number, since it is smaller than the sum of its proper divisors (14183835654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131311130 is a wasteful number, since it uses less digits than its factorization.
10131311130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337710381.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 10131311130 its reverse (3111313101), we get a palindrome (13242624231).
The spelling of 10131311130 in words is "ten billion, one hundred thirty-one million, three hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •