Base | Representation |
---|---|
bin | 11101100101001110001101… |
… | …100110110101100000011111 |
3 | 122001122120000102100202211111 |
4 | 131211032031212311200133 |
5 | 114023034304403144411 |
6 | 1140411402515002451 |
7 | 36255334523501422 |
oct | 3545161546654037 |
9 | 561576012322744 |
10 | 130101230131231 |
11 | 384aa69274a107 |
12 | 127125a6899427 |
13 | 5779654ba8a18 |
14 | 241ad0c7539b9 |
15 | 10093717c1721 |
hex | 76538d9b581f |
130101230131231 has 16 divisors (see below), whose sum is σ = 141422750853120. Its totient is φ = 119325445889760.
The previous prime is 130101230131207. The next prime is 130101230131237. The reversal of 130101230131231 is 132131032101031.
It is a cyclic number.
It is not a de Polignac number, because 130101230131231 - 221 = 130101228034079 is a prime.
It is a super-2 number, since 2×1301012301312312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130101230131237) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 836941405 + ... + 837096838.
It is an arithmetic number, because the mean of its divisors is an integer number (8838921928320).
Almost surely, 2130101230131231 is an apocalyptic number.
130101230131231 is a deficient number, since it is larger than the sum of its proper divisors (11321520721889).
130101230131231 is a wasteful number, since it uses less digits than its factorization.
130101230131231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1674038406.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 130101230131231 its reverse (132131032101031), we get a palindrome (262232262232262).
The spelling of 130101230131231 in words is "one hundred thirty trillion, one hundred one billion, two hundred thirty million, one hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •