Base | Representation |
---|---|
bin | 100000011100011100000… |
… | …0010001111111000001101 |
3 | 120210021202110202111021101 |
4 | 1000320320002033320031 |
5 | 1041024232214313134 |
6 | 13252253434503101 |
7 | 640106025015223 |
oct | 100707002177015 |
9 | 16707673674241 |
10 | 4459116166669 |
11 | 146a111910a5a |
12 | 600258b94a91 |
13 | 264653a3ac48 |
14 | 115b72846b13 |
15 | 7aed271ee14 |
hex | 40e3808fe0d |
4459116166669 has 2 divisors, whose sum is σ = 4459116166670. Its totient is φ = 4459116166668.
The previous prime is 4459116166663. The next prime is 4459116166723. The reversal of 4459116166669 is 9666616119544.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2779922636100 + 1679193530569 = 1667310^2 + 1295837^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4459116166669 is a prime.
It is a super-2 number, since 2×44591161666692 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4459116166669.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4459116166663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2229558083334 + 2229558083335.
It is an arithmetic number, because the mean of its divisors is an integer number (2229558083335).
Almost surely, 24459116166669 is an apocalyptic number.
It is an amenable number.
4459116166669 is a deficient number, since it is larger than the sum of its proper divisors (1).
4459116166669 is an equidigital number, since it uses as much as digits as its factorization.
4459116166669 is an evil number, because the sum of its binary digits is even.
The product of its digits is 50388480, while the sum is 64.
The spelling of 4459116166669 in words is "four trillion, four hundred fifty-nine billion, one hundred sixteen million, one hundred sixty-six thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •