Base | Representation |
---|---|
bin | 111101011100011111111… |
… | …000000001001101000001 |
3 | 112221122222102102101102002 |
4 | 331130133320001031001 |
5 | 1023140123313140112 |
6 | 12551441204033345 |
7 | 614031115444412 |
oct | 75343770011501 |
9 | 15848872371362 |
10 | 4222487630657 |
11 | 138882420759a |
12 | 58241a692855 |
13 | 248242cb082a |
14 | 108525c57809 |
15 | 74c837811c2 |
hex | 3d71fe01341 |
4222487630657 has 2 divisors, whose sum is σ = 4222487630658. Its totient is φ = 4222487630656.
The previous prime is 4222487630651. The next prime is 4222487630659. The reversal of 4222487630657 is 7560367842224.
4222487630657 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3057126359296 + 1165361271361 = 1748464^2 + 1079519^2 .
It is a cyclic number.
It is not a de Polignac number, because 4222487630657 - 212 = 4222487626561 is a prime.
Together with 4222487630659, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (4222487630651) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2111243815328 + 2111243815329.
It is an arithmetic number, because the mean of its divisors is an integer number (2111243815329).
Almost surely, 24222487630657 is an apocalyptic number.
It is an amenable number.
4222487630657 is a deficient number, since it is larger than the sum of its proper divisors (1).
4222487630657 is an equidigital number, since it uses as much as digits as its factorization.
4222487630657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27095040, while the sum is 56.
The spelling of 4222487630657 in words is "four trillion, two hundred twenty-two billion, four hundred eighty-seven million, six hundred thirty thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •