Base | Representation |
---|---|
bin | 10110100110001001… |
… | …00101101110111101 |
3 | 1011022102212021022021 |
4 | 23103010211232331 |
5 | 144321032132201 |
6 | 5323432120141 |
7 | 606422622553 |
oct | 132304455675 |
9 | 34272767267 |
10 | 12131130301 |
11 | 5165785824 |
12 | 2426836051 |
13 | 11b4387914 |
14 | 8311d3bd3 |
15 | 4b0023ea1 |
hex | 2d3125bbd |
12131130301 has 4 divisors (see below), whose sum is σ = 12251240604. Its totient is φ = 12011020000.
The previous prime is 12131130299. The next prime is 12131130343. The reversal of 12131130301 is 10303113121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8445426201 + 3685704100 = 91899^2 + 60710^2 .
It is a cyclic number.
It is not a de Polignac number, because 12131130301 - 21 = 12131130299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12131130371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60055000 + ... + 60055201.
It is an arithmetic number, because the mean of its divisors is an integer number (3062810151).
Almost surely, 212131130301 is an apocalyptic number.
It is an amenable number.
12131130301 is a deficient number, since it is larger than the sum of its proper divisors (120110303).
12131130301 is a wasteful number, since it uses less digits than its factorization.
12131130301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120110302.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 12131130301 its reverse (10303113121), we get a palindrome (22434243422).
The spelling of 12131130301 in words is "twelve billion, one hundred thirty-one million, one hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •