Base | Representation |
---|---|
bin | 10110111010110001… |
… | …11101000111011001 |
3 | 1011202111121012200211 |
4 | 23131120331013121 |
5 | 200144341203423 |
6 | 5352534331121 |
7 | 613624216033 |
oct | 133530750731 |
9 | 34674535624 |
10 | 12304241113 |
11 | 524447250a |
12 | 24747b9aa1 |
13 | 12111b8b58 |
14 | 84a1b6c53 |
15 | 4c031b10d |
hex | 2dd63d1d9 |
12304241113 has 8 divisors (see below), whose sum is σ = 13103329608. Its totient is φ = 11513520384.
The previous prime is 12304241107. The next prime is 12304241119. The reversal of 12304241113 is 31114240321.
It is an interprime number because it is at equal distance from previous prime (12304241107) and next prime (12304241119).
It can be written as a sum of positive squares in 4 ways, for example, as 2810272144 + 9493968969 = 53012^2 + 97437^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12304241113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12304241119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2088906 + ... + 2094787.
It is an arithmetic number, because the mean of its divisors is an integer number (1637916201).
Almost surely, 212304241113 is an apocalyptic number.
It is an amenable number.
12304241113 is a deficient number, since it is larger than the sum of its proper divisors (799088495).
12304241113 is a wasteful number, since it uses less digits than its factorization.
12304241113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4183883.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 12304241113 its reverse (31114240321), we get a palindrome (43418481434).
The spelling of 12304241113 in words is "twelve billion, three hundred four million, two hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •