Base | Representation |
---|---|
bin | 111101001001000110… |
… | …1011011000010000010 |
3 | 110112220122220020221211 |
4 | 1322102031123002002 |
5 | 4122401303323020 |
6 | 140152545440334 |
7 | 12325533451552 |
oct | 1722215330202 |
9 | 415818806854 |
10 | 131302011010 |
11 | 50759620295 |
12 | 215449400aa |
13 | c4c6864c51 |
14 | 64d8391162 |
15 | 36372ee85a |
hex | 1e9235b082 |
131302011010 has 8 divisors (see below), whose sum is σ = 236343619836. Its totient is φ = 52520804400.
The previous prime is 131302011007. The next prime is 131302011013. The reversal of 131302011010 is 10110203131.
It is an interprime number because it is at equal distance from previous prime (131302011007) and next prime (131302011013).
It can be written as a sum of positive squares in 2 ways, for example, as 129854284609 + 1447726401 = 360353^2 + 38049^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1313020110102 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131302011013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6565100541 + ... + 6565100560.
Almost surely, 2131302011010 is an apocalyptic number.
131302011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131302011010 is a deficient number, since it is larger than the sum of its proper divisors (105041608826).
131302011010 is a wasteful number, since it uses less digits than its factorization.
131302011010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13130201108.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 131302011010 its reverse (10110203131), we get a palindrome (141412214141).
The spelling of 131302011010 in words is "one hundred thirty-one billion, three hundred two million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •