Base | Representation |
---|---|
bin | 100100000100111000101… |
… | …110110001111011110001 |
3 | 22210000010002011222212202 |
4 | 210010320232301323301 |
5 | 311104243331321131 |
6 | 5134523235432545 |
7 | 344053411412555 |
oct | 44047056617361 |
9 | 8700102158782 |
10 | 2479147917041 |
11 | 876445405774 |
12 | 340585755755 |
13 | 14ca2361a103 |
14 | 87dc4585865 |
15 | 4474d180bcb |
hex | 24138bb1ef1 |
2479147917041 has 2 divisors, whose sum is σ = 2479147917042. Its totient is φ = 2479147917040.
The previous prime is 2479147917017. The next prime is 2479147917091. The reversal of 2479147917041 is 1407197419742.
2479147917041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2245742016400 + 233405900641 = 1498580^2 + 483121^2 .
It is a cyclic number.
It is not a de Polignac number, because 2479147917041 - 218 = 2479147654897 is a prime.
It is a super-2 number, since 2×24791479170412 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2479147917091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1239573958520 + 1239573958521.
It is an arithmetic number, because the mean of its divisors is an integer number (1239573958521).
Almost surely, 22479147917041 is an apocalyptic number.
It is an amenable number.
2479147917041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2479147917041 is an equidigital number, since it uses as much as digits as its factorization.
2479147917041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3556224, while the sum is 56.
The spelling of 2479147917041 in words is "two trillion, four hundred seventy-nine billion, one hundred forty-seven million, nine hundred seventeen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •