Base | Representation |
---|---|
bin | 1110111010101010… |
… | …1000011011000100 |
3 | 101100001112001100000 |
4 | 3232222220123010 |
5 | 31200030344103 |
6 | 1501154521300 |
7 | 201140511351 |
oct | 35652503304 |
9 | 11301461300 |
10 | 4004153028 |
11 | 1775270487 |
12 | 938b96230 |
13 | 4ba746b25 |
14 | 29db15628 |
15 | 1867e5aa3 |
hex | eeaa86c4 |
4004153028 has 144 divisors (see below), whose sum is σ = 10697523200. Its totient is φ = 1309470624.
The previous prime is 4004153017. The next prime is 4004153057. The reversal of 4004153028 is 8203514004.
4004153028 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 (27).
It is a junction number, because it is equal to n+sod(n) for n = 4004152992 and 4004153010.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20121273 + ... + 20121471.
Almost surely, 24004153028 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4004153028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5348761600).
4004153028 is an abundant number, since it is smaller than the sum of its proper divisors (6693370172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4004153028 is a wasteful number, since it uses less digits than its factorization.
4004153028 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 508 (or 494 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 4004153028 is about 63278.3772547938. The cubic root of 4004153028 is about 1587.9502386977.
The spelling of 4004153028 in words is "four billion, four million, one hundred fifty-three thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •