Base | Representation |
---|---|
bin | 10110100100000001… |
… | …00111001011001101 |
3 | 1011021012022221000102 |
4 | 23102000213023031 |
5 | 144302001413123 |
6 | 5321554140445 |
7 | 606115303541 |
oct | 132200471315 |
9 | 34235287012 |
10 | 12113310413 |
11 | 5156714446 |
12 | 2420881725 |
13 | 11b07888c9 |
14 | 82cab5a21 |
15 | 4ad6a4028 |
hex | 2d20272cd |
12113310413 has 4 divisors (see below), whose sum is σ = 12119821308. Its totient is φ = 12106799520.
The previous prime is 12113310401. The next prime is 12113310437. The reversal of 12113310413 is 31401331121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31401331121 = 3539 ⋅8872939.
It can be written as a sum of positive squares in 2 ways, for example, as 1009841284 + 11103469129 = 31778^2 + 105373^2 .
It is a cyclic number.
It is not a de Polignac number, because 12113310413 - 226 = 12046201549 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 (12113390413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3252656 + ... + 3256377.
It is an arithmetic number, because the mean of its divisors is an integer number (3029955327).
Almost surely, 212113310413 is an apocalyptic number.
It is an amenable number.
12113310413 is a deficient number, since it is larger than the sum of its proper divisors (6510895).
12113310413 is an equidigital number, since it uses as much as digits as its factorization.
12113310413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6510894.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12113310413 its reverse (31401331121), we get a palindrome (43514641534).
The spelling of 12113310413 in words is "twelve billion, one hundred thirteen million, three hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •