Base | Representation |
---|---|
bin | 1011001100001101100101… |
… | …0000001001001001110101 |
3 | 1121120021212222010121022020 |
4 | 2303003121100021021311 |
5 | 3103043433343122123 |
6 | 42100324435423353 |
7 | 2406652163505510 |
oct | 263033120111165 |
9 | 47507788117266 |
10 | 12304431223413 |
11 | 3a1430971690a |
12 | 1468821154b59 |
13 | 6b33c2594284 |
14 | 307775445d77 |
15 | 1650ee6347e3 |
hex | b30d9409275 |
12304431223413 has 8 divisors (see below), whose sum is σ = 18749609483328. Its totient is φ = 7031103556224.
The previous prime is 12304431223391. The next prime is 12304431223429. The reversal of 12304431223413 is 31432213440321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12304431223413 - 29 = 12304431222901 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12304431223433) 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 7 ways as a sum of consecutive naturals, for example, 292962648156 + ... + 292962648197.
It is an arithmetic number, because the mean of its divisors is an integer number (2343701185416).
Almost surely, 212304431223413 is an apocalyptic number.
It is an amenable number.
12304431223413 is a deficient number, since it is larger than the sum of its proper divisors (6445178259915).
12304431223413 is an equidigital number, since it uses as much as digits as its factorization.
12304431223413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585925296363.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 12304431223413 its reverse (31432213440321), we get a palindrome (43736644663734).
The spelling of 12304431223413 in words is "twelve trillion, three hundred four billion, four hundred thirty-one million, two hundred twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •