Base | Representation |
---|---|
bin | 1111111001000110… |
… | …0100111111100000 |
3 | 102000022021022102120 |
4 | 3332101210333200 |
5 | 32214100131312 |
6 | 1543151344240 |
7 | 210500402343 |
oct | 37621447740 |
9 | 12008238376 |
10 | 4266020832 |
11 | 189a06a657 |
12 | 9b0822080 |
13 | 52ca832a8 |
14 | 2c680045a |
15 | 19e7c128c |
hex | fe464fe0 |
4266020832 has 24 divisors (see below), whose sum is σ = 11198304936. Its totient is φ = 1422006912.
The previous prime is 4266020831. The next prime is 4266020833. The reversal of 4266020832 is 2380206624.
It is an interprime number because it is at equal distance from previous prime (4266020831) and next prime (4266020833).
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 4266020793 and 4266020802.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4266020831) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22218763 + ... + 22218954.
It is an arithmetic number, because the mean of its divisors is an integer number (466596039).
Almost surely, 24266020832 is an apocalyptic number.
It is an amenable number.
4266020832 is an abundant number, since it is smaller than the sum of its proper divisors (6932284104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4266020832 is a wasteful number, since it uses less digits than its factorization.
4266020832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44437730 (or 44437722 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 33.
The square root of 4266020832 is about 65314.7826452787. The cubic root of 4266020832 is about 1621.8386926714.
The spelling of 4266020832 in words is "four billion, two hundred sixty-six million, twenty thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •