Base | Representation |
---|---|
bin | 10010110111101110… |
… | …01100101110101110 |
3 | 222011001111210110120 |
4 | 21123313030232232 |
5 | 131222032200220 |
6 | 4353145145410 |
7 | 506026123656 |
oct | 113367145656 |
9 | 28131453416 |
10 | 10131131310 |
11 | 43298399a3 |
12 | 1b68a8b266 |
13 | c55c10b71 |
14 | 6c1739366 |
15 | 3e4661a40 |
hex | 25bdccbae |
10131131310 has 64 divisors (see below), whose sum is σ = 25802012160. Its totient is φ = 2540362880.
The previous prime is 10131131299. The next prime is 10131131347. The reversal of 10131131310 is 1313113101.
It is a super-2 number, since 2×101311313102 (a number of 21 digits) contains 22 as substring.
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 10131131310.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 83721 + ... + 165140.
It is an arithmetic number, because the mean of its divisors is an integer number (403156440).
Almost surely, 210131131310 is an apocalyptic number.
10131131310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10131131310 is an abundant number, since it is smaller than the sum of its proper divisors (15670880850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131131310 is a wasteful number, since it uses less digits than its factorization.
10131131310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248953.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 10131131310 its reverse (1313113101), we get a palindrome (11444244411).
The spelling of 10131131310 in words is "ten billion, one hundred thirty-one million, one hundred thirty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •