Base | Representation |
---|---|
bin | 10111001111100100… |
… | …10110000101000011 |
3 | 1012012122211001221111 |
4 | 23213302112011003 |
5 | 201024014402443 |
6 | 5422125104151 |
7 | 621142636354 |
oct | 134762260503 |
9 | 35178731844 |
10 | 12478669123 |
11 | 5323979898 |
12 | 25030b8057 |
13 | 123b38b7ab |
14 | 86541dd2b |
15 | 4d07c369d |
hex | 2e7c96143 |
12478669123 has 4 divisors (see below), whose sum is σ = 12636627040. Its totient is φ = 12320711208.
The previous prime is 12478669117. The next prime is 12478669141. The reversal of 12478669123 is 32196687421.
It is a happy number.
12478669123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32196687421 = 431 ⋅74702291.
It is a cyclic number.
It is not a de Polignac number, because 12478669123 - 221 = 12476571971 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12478669183) 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 3 ways as a sum of consecutive naturals, for example, 78978840 + ... + 78978997.
It is an arithmetic number, because the mean of its divisors is an integer number (3159156760).
Almost surely, 212478669123 is an apocalyptic number.
12478669123 is a deficient number, since it is larger than the sum of its proper divisors (157957917).
12478669123 is an equidigital number, since it uses as much as digits as its factorization.
12478669123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157957916.
The product of its digits is 870912, while the sum is 49.
The spelling of 12478669123 in words is "twelve billion, four hundred seventy-eight million, six hundred sixty-nine thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •