Base | Representation |
---|---|
bin | 101101100011001111110… |
… | …010011100111111001011 |
3 | 102002020122120111120220011 |
4 | 231203033302130333023 |
5 | 402241143402114011 |
6 | 10354000531212351 |
7 | 442102553360512 |
oct | 55431762347713 |
9 | 12066576446804 |
10 | 3130222301131 |
11 | aa757997aa52 |
12 | 4267a91470b7 |
13 | 199242799663 |
14 | ab709b0b679 |
15 | 56656d69621 |
hex | 2d8cfc9cfcb |
3130222301131 has 16 divisors (see below), whose sum is σ = 3244030567200. Its totient is φ = 3016807250688.
The previous prime is 3130222301123. The next prime is 3130222301159. The reversal of 3130222301131 is 1311032220313.
3130222301131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3130222301131 - 23 = 3130222301123 is a prime.
It is a super-2 number, since 2×31302223011312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3130222301231) 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, 115736296 + ... + 115763338.
It is an arithmetic number, because the mean of its divisors is an integer number (202751910450).
Almost surely, 23130222301131 is an apocalyptic number.
3130222301131 is a deficient number, since it is larger than the sum of its proper divisors (113808266069).
3130222301131 is a wasteful number, since it uses less digits than its factorization.
3130222301131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34158.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 3130222301131 its reverse (1311032220313), we get a palindrome (4441254521444).
The spelling of 3130222301131 in words is "three trillion, one hundred thirty billion, two hundred twenty-two million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •