Base | Representation |
---|---|
bin | 1111001111001000… |
… | …0111010011100000 |
3 | 101120001001120002000 |
4 | 3303302013103200 |
5 | 31334020004413 |
6 | 1513502524000 |
7 | 203232301011 |
oct | 36362072340 |
9 | 11501046060 |
10 | 4090000608 |
11 | 1809775aa1 |
12 | 961896600 |
13 | 502473a05 |
14 | 2ab2a1008 |
15 | 18e102073 |
hex | f3c874e0 |
4090000608 has 48 divisors (see below), whose sum is σ = 11929170960. Its totient is φ = 1363333248.
The previous prime is 4090000589. The next prime is 4090000613. The reversal of 4090000608 is 8060000904.
4090000608 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2366035 + ... + 2367762.
It is an arithmetic number, because the mean of its divisors is an integer number (248524395).
Almost surely, 24090000608 is an apocalyptic number.
4090000608 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4090000608 is an abundant number, since it is smaller than the sum of its proper divisors (7839170352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4090000608 is a wasteful number, since it uses less digits than its factorization.
4090000608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4733816 (or 4733802 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 4090000608 is about 63953.1125747606. The cubic root of 4090000608 is about 1599.2184474636.
The spelling of 4090000608 in words is "four billion, ninety million, six hundred eight", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •