Base | Representation |
---|---|
bin | 10111000110110100… |
… | …01000011111000011 |
3 | 1012000112121010020220 |
4 | 23203122020133003 |
5 | 200401213304443 |
6 | 5410542434123 |
7 | 616261400052 |
oct | 134332103703 |
9 | 35015533226 |
10 | 12405213123 |
11 | 5296468256 |
12 | 24a2592943 |
13 | 12290acbc4 |
14 | 85977c399 |
15 | 4c9113a83 |
hex | 2e36887c3 |
12405213123 has 8 divisors (see below), whose sum is σ = 17513242128. Its totient is φ = 7783663104.
The previous prime is 12405213103. The next prime is 12405213131. The reversal of 12405213123 is 32131250421.
12405213123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12405213123 - 224 = 12388435907 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12405213093 and 12405213102.
It is not an unprimeable number, because it can be changed into a prime (12405213103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121619686 + ... + 121619787.
It is an arithmetic number, because the mean of its divisors is an integer number (2189155266).
Almost surely, 212405213123 is an apocalyptic number.
12405213123 is a deficient number, since it is larger than the sum of its proper divisors (5108029005).
12405213123 is a wasteful number, since it uses less digits than its factorization.
12405213123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243239493.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 12405213123 its reverse (32131250421), we get a palindrome (44536463544).
The spelling of 12405213123 in words is "twelve billion, four hundred five million, two hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •