Base | Representation |
---|---|
bin | 1011010011000111010100… |
… | …0011010001110111010110 |
3 | 1121222121221212112122111001 |
4 | 2310301311003101313112 |
5 | 3112014310324321120 |
6 | 42231015053333514 |
7 | 2421350515006561 |
oct | 264616503216726 |
9 | 47877855478431 |
10 | 12423009213910 |
11 | 3a5a62891a169 |
12 | 14877b479729a |
13 | 6c163bc94ba9 |
14 | 30d3c398b4d8 |
15 | 16823e848e0a |
hex | b4c750d1dd6 |
12423009213910 has 64 divisors (see below), whose sum is σ = 22811536742400. Its totient is φ = 4870323327232.
The previous prime is 12423009213851. The next prime is 12423009213911. The reversal of 12423009213910 is 1931290032421.
It is a super-2 number, since 2×124230092139102 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12423009213910.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12423009213911) 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 31 ways as a sum of consecutive naturals, for example, 53241759 + ... + 53474581.
It is an arithmetic number, because the mean of its divisors is an integer number (356430261600).
Almost surely, 212423009213910 is an apocalyptic number.
12423009213910 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12423009213910 is a deficient number, since it is larger than the sum of its proper divisors (10388527528490).
12423009213910 is a wasteful number, since it uses less digits than its factorization.
12423009213910 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233445.
The product of its (nonzero) digits is 23328, while the sum is 37.
The spelling of 12423009213910 in words is "twelve trillion, four hundred twenty-three billion, nine million, two hundred thirteen thousand, nine hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •