Base | Representation |
---|---|
bin | 1000101001001011… |
… | …11110000001101001 |
3 | 102222101212001021010 |
4 | 10110211332001221 |
5 | 34000424340001 |
6 | 2044245134133 |
7 | 222665205324 |
oct | 42445760151 |
9 | 12871761233 |
10 | 4640465001 |
11 | 1a71470047 |
12 | a960ba349 |
13 | 58c5176a3 |
14 | 3204317bb |
15 | 1c25d78d6 |
hex | 11497e069 |
4640465001 has 16 divisors (see below), whose sum is σ = 6359859968. Its totient is φ = 3007497600.
The previous prime is 4640464999. The next prime is 4640465003. The reversal of 4640465001 is 1005640464.
4640465001 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (4640464999) and next prime (4640465003).
It is not a de Polignac number, because 4640465001 - 21 = 4640464999 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 4640465001.
It is not an unprimeable number, because it can be changed into a prime (4640465003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 119661 + ... + 153621.
It is an arithmetic number, because the mean of its divisors is an integer number (397491248).
Almost surely, 24640465001 is an apocalyptic number.
It is an amenable number.
4640465001 is a deficient number, since it is larger than the sum of its proper divisors (1719394967).
4640465001 is a wasteful number, since it uses less digits than its factorization.
4640465001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35232.
The product of its (nonzero) digits is 11520, while the sum is 30.
The square root of 4640465001 is about 68120.9586030614. The cubic root of 4640465001 is about 1667.9658981664.
The spelling of 4640465001 in words is "four billion, six hundred forty million, four hundred sixty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •