Base | Representation |
---|---|
bin | 1110111110100110… |
… | …0110100100010001 |
3 | 101101012120201022202 |
4 | 3233221212210101 |
5 | 31213242113442 |
6 | 1502544412545 |
7 | 201431023160 |
oct | 35751464421 |
9 | 11335521282 |
10 | 4020660497 |
11 | 1783615817 |
12 | 942617155 |
13 | 4c0ca6669 |
14 | 2a1db13d7 |
15 | 187ea6c32 |
hex | efa66911 |
4020660497 has 16 divisors (see below), whose sum is σ = 4874152320. Its totient is φ = 3237681408.
The previous prime is 4020660481. The next prime is 4020660499. The reversal of 4020660497 is 7940660204.
4020660497 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 4020660497 - 24 = 4020660481 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4020660497.
It is not an unprimeable number, because it can be changed into a prime (4020660499) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35954 + ... + 96612.
It is an arithmetic number, because the mean of its divisors is an integer number (304634520).
Almost surely, 24020660497 is an apocalyptic number.
It is an amenable number.
4020660497 is a deficient number, since it is larger than the sum of its proper divisors (853491823).
4020660497 is a wasteful number, since it uses less digits than its factorization.
4020660497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61240.
The product of its (nonzero) digits is 72576, while the sum is 38.
The square root of 4020660497 is about 63408.6784044582. The cubic root of 4020660497 is about 1590.1294011479.
The spelling of 4020660497 in words is "four billion, twenty million, six hundred sixty thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •