Base | Representation |
---|---|
bin | 1111110111101101… |
… | …1011111010001001 |
3 | 101222220100102022201 |
4 | 3331323123322021 |
5 | 32211103411312 |
6 | 1542423120201 |
7 | 210400146100 |
oct | 37573337211 |
9 | 11886312281 |
10 | 4260216457 |
11 | 1896865752 |
12 | 9aa8a3061 |
13 | 52b800353 |
14 | 2c5b2d037 |
15 | 19e026557 |
hex | fdedbe89 |
4260216457 has 6 divisors (see below), whose sum is σ = 4955762058. Its totient is φ = 3651614064.
The previous prime is 4260216451. The next prime is 4260216463. The reversal of 4260216457 is 7546120624.
It is an interprime number because it is at equal distance from previous prime (4260216451) and next prime (4260216463).
It can be written as a sum of positive squares in only one way, i.e., 4158186256 + 102030201 = 64484^2 + 10101^2 .
It is not a de Polignac number, because 4260216457 - 27 = 4260216329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4260216451) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 43471548 + ... + 43471645.
It is an arithmetic number, because the mean of its divisors is an integer number (825960343).
Almost surely, 24260216457 is an apocalyptic number.
It is an amenable number.
4260216457 is a deficient number, since it is larger than the sum of its proper divisors (695545601).
4260216457 is an equidigital number, since it uses as much as digits as its factorization.
4260216457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86943207 (or 86943200 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 37.
The square root of 4260216457 is about 65270.3336669884. Note that the first 3 decimals coincide. The cubic root of 4260216457 is about 1621.1027974788.
The spelling of 4260216457 in words is "four billion, two hundred sixty million, two hundred sixteen thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •