Base | Representation |
---|---|
bin | 1101010010111000111… |
… | …11001111100110010001 |
3 | 1121200010110002101112212 |
4 | 12221130133033212101 |
5 | 24441030431240401 |
6 | 545505344001505 |
7 | 45001244603231 |
oct | 6513437174621 |
9 | 1550113071485 |
10 | 456818227601 |
11 | 16680aa8679a |
12 | 7464b600295 |
13 | 34101b3c468 |
14 | 18178253cc1 |
15 | bd39b4ddbb |
hex | 6a5c7cf991 |
456818227601 has 2 divisors, whose sum is σ = 456818227602. Its totient is φ = 456818227600.
The previous prime is 456818227501. The next prime is 456818227603. The reversal of 456818227601 is 106722818654.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 434676490000 + 22141737601 = 659300^2 + 148801^2 .
It is a cyclic number.
It is not a de Polignac number, because 456818227601 - 226 = 456751118737 is a prime.
It is a super-4 number, since 4×4568182276014 (a number of 48 digits) contains 4444 as substring.
Together with 456818227603, 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 456818227601.
It is not a weakly prime, because it can be changed into another prime (456818227603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 228409113800 + 228409113801.
It is an arithmetic number, because the mean of its divisors is an integer number (228409113801).
Almost surely, 2456818227601 is an apocalyptic number.
It is an amenable number.
456818227601 is a deficient number, since it is larger than the sum of its proper divisors (1).
456818227601 is an equidigital number, since it uses as much as digits as its factorization.
456818227601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1290240, while the sum is 50.
The spelling of 456818227601 in words is "four hundred fifty-six billion, eight hundred eighteen million, two hundred twenty-seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •