Base | Representation |
---|---|
bin | 1011000111111000110010… |
… | …1100010100111011011101 |
3 | 1121022012002221122100100021 |
4 | 2301332030230110323131 |
5 | 3100334302333301023 |
6 | 42002240100232141 |
7 | 2401412036326564 |
oct | 261761454247335 |
9 | 47265087570307 |
10 | 12230132322013 |
11 | 3995851947571 |
12 | 145634669b651 |
13 | 6a93b16234a8 |
14 | 303d27910bdb |
15 | 16320190a35d |
hex | b1f8cb14edd |
12230132322013 has 8 divisors (see below), whose sum is σ = 12528498588480. Its totient is φ = 11931769405920.
The previous prime is 12230132321977. The next prime is 12230132322043. The reversal of 12230132322013 is 31022323103221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12230132322013 - 225 = 12230098767581 is a prime.
It is a super-2 number, since 2×122301323220132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12230132322043) 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, 7568958 + ... + 9041536.
It is an arithmetic number, because the mean of its divisors is an integer number (1566062323560).
Almost surely, 212230132322013 is an apocalyptic number.
It is an amenable number.
12230132322013 is a deficient number, since it is larger than the sum of its proper divisors (298366266467).
12230132322013 is a wasteful number, since it uses less digits than its factorization.
12230132322013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1675187.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 12230132322013 its reverse (31022323103221), we get a palindrome (43252455425234).
The spelling of 12230132322013 in words is "twelve trillion, two hundred thirty billion, one hundred thirty-two million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •