Base | Representation |
---|---|
bin | 1011001100101010101010… |
… | …1100101110100010011101 |
3 | 1121121001001011221202100220 |
4 | 2303022222230232202131 |
5 | 3103210431432401023 |
6 | 42104055351311553 |
7 | 2410346534162646 |
oct | 263125254564235 |
9 | 47531034852326 |
10 | 12312240122013 |
11 | 3a17656629a17 |
12 | 146a24037b5b9 |
13 | 6b4068347530 |
14 | 307cb65a66cd |
15 | 165409e823e3 |
hex | b32aab2e89d |
12312240122013 has 16 divisors (see below), whose sum is σ = 17679195520896. Its totient is φ = 7576728223680.
The previous prime is 12312240122009. The next prime is 12312240122071. The reversal of 12312240122013 is 31022104221321.
It is not a de Polignac number, because 12312240122013 - 22 = 12312240122009 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12312240122113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9750768 + ... + 10940838.
It is an arithmetic number, because the mean of its divisors is an integer number (1104949720056).
Almost surely, 212312240122013 is an apocalyptic number.
12312240122013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12312240122013 is a deficient number, since it is larger than the sum of its proper divisors (5366955398883).
12312240122013 is a wasteful number, since it uses less digits than its factorization.
12312240122013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1455364.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 12312240122013 its reverse (31022104221321), we get a palindrome (43334344343334).
The spelling of 12312240122013 in words is "twelve trillion, three hundred twelve billion, two hundred forty million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •