Base | Representation |
---|---|
bin | 100100111110101000… |
… | …1000000110011000111 |
3 | 21120222021211221111202 |
4 | 1021331101000303013 |
5 | 2300113210214142 |
6 | 100251513453115 |
7 | 5510610362426 |
oct | 1117521006307 |
9 | 246867757452 |
10 | 79411023047 |
11 | 307504a7a74 |
12 | 1348271119b |
13 | 76470c8645 |
14 | 3bb48612bd |
15 | 20eb92c032 |
hex | 127d440cc7 |
79411023047 has 2 divisors, whose sum is σ = 79411023048. Its totient is φ = 79411023046.
The previous prime is 79411023019. The next prime is 79411023049. The reversal of 79411023047 is 74032011497.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 79411023047 - 210 = 79411022023 is a prime.
It is a super-3 number, since 3×794110230473 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 79411023049, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 79411023047.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (79411023049) 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 as a sum of consecutive naturals, namely, 39705511523 + 39705511524.
It is an arithmetic number, because the mean of its divisors is an integer number (39705511524).
Almost surely, 279411023047 is an apocalyptic number.
79411023047 is a deficient number, since it is larger than the sum of its proper divisors (1).
79411023047 is an equidigital number, since it uses as much as digits as its factorization.
79411023047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42336, while the sum is 38.
The spelling of 79411023047 in words is "seventy-nine billion, four hundred eleven million, twenty-three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •