Base | Representation |
---|---|
bin | 111100100110001101… |
… | …1001011001111011111 |
3 | 110102220001211110121001 |
4 | 1321030123023033133 |
5 | 4113002042224411 |
6 | 135440443251131 |
7 | 12254526021250 |
oct | 1711433131737 |
9 | 412801743531 |
10 | 130131211231 |
11 | 5020874906a |
12 | 21278819aa7 |
13 | c36b125708 |
14 | 6426aa2b27 |
15 | 35b9630dc1 |
hex | 1e4c6cb3df |
130131211231 has 32 divisors (see below), whose sum is σ = 155032178688. Its totient is φ = 106901182080.
The previous prime is 130131211213. The next prime is 130131211241. The reversal of 130131211231 is 132112131031.
It is not a de Polignac number, because 130131211231 - 211 = 130131209183 is a prime.
It is a super-2 number, since 2×1301312112312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130131211199 and 130131211208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130131211201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26165061 + ... + 26170033.
It is an arithmetic number, because the mean of its divisors is an integer number (4844755584).
Almost surely, 2130131211231 is an apocalyptic number.
130131211231 is a deficient number, since it is larger than the sum of its proper divisors (24900967457).
130131211231 is a wasteful number, since it uses less digits than its factorization.
130131211231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6511.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 130131211231 its reverse (132112131031), we get a palindrome (262243342262).
The spelling of 130131211231 in words is "one hundred thirty billion, one hundred thirty-one million, two hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •