Base | Representation |
---|---|
bin | 1011000001101101100000… |
… | …1010000000111101001011 |
3 | 1120221001020002111221011210 |
4 | 2300123120022000331023 |
5 | 3042120000144311243 |
6 | 41441411055224203 |
7 | 2360634423306201 |
oct | 260333012007513 |
9 | 46831202457153 |
10 | 12124024213323 |
11 | 3954851660a60 |
12 | 1439873218063 |
13 | 69c3a1525769 |
14 | 2dcb3d57d071 |
15 | 160591330933 |
hex | b06d8280f4b |
12124024213323 has 32 divisors (see below), whose sum is σ = 17884109117952. Its totient is φ = 7244083884800.
The previous prime is 12124024213313. The next prime is 12124024213337. The reversal of 12124024213323 is 32331242042121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 12124024213323 - 210 = 12124024212299 is a prime.
It is a super-3 number, since 3×121240242133233 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (12124024213303) 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 31 ways as a sum of consecutive naturals, for example, 60051061 + ... + 60252617.
It is an arithmetic number, because the mean of its divisors is an integer number (558878409936).
Almost surely, 212124024213323 is an apocalyptic number.
12124024213323 is a deficient number, since it is larger than the sum of its proper divisors (5760084904629).
12124024213323 is a wasteful number, since it uses less digits than its factorization.
12124024213323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227315.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 12124024213323 its reverse (32331242042121), we get a palindrome (44455266255444).
The spelling of 12124024213323 in words is "twelve trillion, one hundred twenty-four billion, twenty-four million, two hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •