Base | Representation |
---|---|
bin | 10110111010110001… |
… | …10110100000001111 |
3 | 1011202111112211112210 |
4 | 23131120312200033 |
5 | 200144334322111 |
6 | 5352534001503 |
7 | 613624044054 |
oct | 133530664017 |
9 | 34674484483 |
10 | 12304214031 |
11 | 524445412a |
12 | 24747a6293 |
13 | 12111a9725 |
14 | 84a1ab02b |
15 | 4c03130a6 |
hex | 2dd63680f |
12304214031 has 4 divisors (see below), whose sum is σ = 16405618712. Its totient is φ = 8202809352.
The previous prime is 12304214017. The next prime is 12304214033. The reversal of 12304214031 is 13041240321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13041240321 = 3 ⋅4347080107.
It is not a de Polignac number, because 12304214031 - 26 = 12304213967 is a prime.
It is a super-2 number, since 2×123042140312 (a number of 21 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 = 12304213989 and 12304214007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12304214033) 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, 2050702336 + ... + 2050702341.
It is an arithmetic number, because the mean of its divisors is an integer number (4101404678).
Almost surely, 212304214031 is an apocalyptic number.
12304214031 is a deficient number, since it is larger than the sum of its proper divisors (4101404681).
12304214031 is an equidigital number, since it uses as much as digits as its factorization.
12304214031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4101404680.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 12304214031 its reverse (13041240321), we get a palindrome (25345454352).
The spelling of 12304214031 in words is "twelve billion, three hundred four million, two hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •