Base | Representation |
---|---|
bin | 1111111011100111… |
… | …1101010111000001 |
3 | 102001001012010002200 |
4 | 3332321331113001 |
5 | 32224302401101 |
6 | 1544210303413 |
7 | 210656361144 |
oct | 37671752701 |
9 | 12031163080 |
10 | 4276606401 |
11 | 18a503a761 |
12 | 9b4287b69 |
13 | 53201b542 |
14 | 2c7d9805b |
15 | 1a06b2986 |
hex | fee7d5c1 |
4276606401 has 6 divisors (see below), whose sum is σ = 6177320370. Its totient is φ = 2851070928.
The previous prime is 4276606381. The next prime is 4276606421. The reversal of 4276606401 is 1046066724.
4276606401 is a `hidden beast` number, since 4 + 2 + 7 + 6 + 6 + 0 + 640 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (4276606381) and next prime (4276606421).
It can be written as a sum of positive squares in only one way, i.e., 3994366401 + 282240000 = 63201^2 + 16800^2 .
It is not a de Polignac number, because 4276606401 - 215 = 4276573633 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4276606421) 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, 237589236 + ... + 237589253.
It is an arithmetic number, because the mean of its divisors is an integer number (1029553395).
Almost surely, 24276606401 is an apocalyptic number.
It is an amenable number.
4276606401 is a deficient number, since it is larger than the sum of its proper divisors (1900713969).
4276606401 is a wasteful number, since it uses less digits than its factorization.
4276606401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475178495 (or 475178492 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 4276606401 is about 65395.7674547826. The cubic root of 4276606401 is about 1623.1790443709.
The spelling of 4276606401 in words is "four billion, two hundred seventy-six million, six hundred six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •