Base | Representation |
---|---|
bin | 1111101010010101… |
… | …1001010010110000 |
3 | 101211222202202112000 |
4 | 3322211121102300 |
5 | 32102222410203 |
6 | 1533100334000 |
7 | 206116214340 |
oct | 37245312260 |
9 | 11758682460 |
10 | 4204106928 |
11 | 186812183a |
12 | 993b44300 |
13 | 51ccb6148 |
14 | 2bc4c4d20 |
15 | 1991414a3 |
hex | fa9594b0 |
4204106928 has 80 divisors (see below), whose sum is σ = 13791260160. Its totient is φ = 1201172544.
The previous prime is 4204106917. The next prime is 4204106941. The reversal of 4204106928 is 8296014024.
4204106928 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 4204106892 and 4204106901.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 692100 + ... + 698147.
It is an arithmetic number, because the mean of its divisors is an integer number (172390752).
Almost surely, 24204106928 is an apocalyptic number.
4204106928 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4204106928 is an abundant number, since it is smaller than the sum of its proper divisors (9587153232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4204106928 is a wasteful number, since it uses less digits than its factorization.
4204106928 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1390271 (or 1390259 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 4204106928 is about 64839.0848794151. The cubic root of 4204106928 is about 1613.9543663940.
The spelling of 4204106928 in words is "four billion, two hundred four million, one hundred six thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •