Base | Representation |
---|---|
bin | 111100101000100110… |
… | …0101111011001001111 |
3 | 110110002122120001212210 |
4 | 1321101030233121033 |
5 | 4113133044010411 |
6 | 135452424201503 |
7 | 12256520620626 |
oct | 1712114573117 |
9 | 413078501783 |
10 | 130211313231 |
11 | 5024998996a |
12 | 2129b609293 |
13 | c3818c034c |
14 | 64335946bd |
15 | 35c16a4ca6 |
hex | 1e5132f64f |
130211313231 has 8 divisors (see below), whose sum is σ = 177309022464. Its totient is φ = 84960573080.
The previous prime is 130211313229. The next prime is 130211313263. The reversal of 130211313231 is 132313112031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130211313231 - 21 = 130211313229 is a prime.
It is a super-2 number, since 2×1302113132312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130211313198 and 130211313207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130211413231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 461742105 + ... + 461742386.
It is an arithmetic number, because the mean of its divisors is an integer number (22163627808).
Almost surely, 2130211313231 is an apocalyptic number.
130211313231 is a deficient number, since it is larger than the sum of its proper divisors (47097709233).
130211313231 is an equidigital number, since it uses as much as digits as its factorization.
130211313231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 923484541.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 130211313231 its reverse (132313112031), we get a palindrome (262524425262).
The spelling of 130211313231 in words is "one hundred thirty billion, two hundred eleven million, three hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •