Base | Representation |
---|---|
bin | 10111001001000011… |
… | …01100101010101011 |
3 | 1012001211220020201102 |
4 | 23210201230222223 |
5 | 200421014123142 |
6 | 5412452512015 |
7 | 616610014136 |
oct | 134441545253 |
9 | 35054806642 |
10 | 12423973547 |
11 | 52a6011237 |
12 | 24a891b60b |
13 | 122cc4b04b |
14 | 85c06321d |
15 | 4caabc532 |
hex | 2e486caab |
12423973547 has 8 divisors (see below), whose sum is σ = 12664969536. Its totient is φ = 12184611912.
The previous prime is 12423973543. The next prime is 12423973579. The reversal of 12423973547 is 74537932421.
It is a happy number.
12423973547 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 a cyclic number.
It is not a de Polignac number, because 12423973547 - 22 = 12423973543 is a prime.
It is a super-2 number, since 2×124239735472 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12423973543) 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, 393233 + ... + 423650.
It is an arithmetic number, because the mean of its divisors is an integer number (1583121192).
Almost surely, 212423973547 is an apocalyptic number.
12423973547 is a deficient number, since it is larger than the sum of its proper divisors (240995989).
12423973547 is an equidigital number, since it uses as much as digits as its factorization.
12423973547 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 817177.
The product of its digits is 1270080, while the sum is 47.
The spelling of 12423973547 in words is "twelve billion, four hundred twenty-three million, nine hundred seventy-three thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •