Base | Representation |
---|---|
bin | 1000111001100110… |
… | …0100110011010000 |
3 | 20011111110021120100 |
4 | 2032121210303100 |
5 | 14343100202013 |
6 | 1033022012400 |
7 | 113126515524 |
oct | 21631446320 |
9 | 6144407510 |
10 | 2389069008 |
11 | 10166269a7 |
12 | 568117100 |
13 | 2c0c5c401 |
14 | 189415d84 |
15 | deb17473 |
hex | 8e664cd0 |
2389069008 has 120 divisors (see below), whose sum is σ = 6817599360. Its totient is φ = 780848640.
The previous prime is 2389069003. The next prime is 2389069019. The reversal of 2389069008 is 8009609832.
It is a super-2 number, since 2×23890690082 = 11415301449972208128, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2389069003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1678185 + ... + 1679607.
It is an arithmetic number, because the mean of its divisors is an integer number (56813328).
Almost surely, 22389069008 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 2389069008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3408799680).
2389069008 is an abundant number, since it is smaller than the sum of its proper divisors (4428530352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2389069008 is a wasteful number, since it uses less digits than its factorization.
2389069008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1657 (or 1648 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 45.
The square root of 2389069008 is about 48878.1035638659. The cubic root of 2389069008 is about 1336.8301490815.
The spelling of 2389069008 in words is "two billion, three hundred eighty-nine million, sixty-nine thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •