Base | Representation |
---|---|
bin | 10001011011001111… |
… | …110011000111011000 |
3 | 1210021222112221101220 |
4 | 101123033303013120 |
5 | 301304422043433 |
6 | 12332352012040 |
7 | 1231445433501 |
oct | 213317630730 |
9 | 53258487356 |
10 | 18710737368 |
11 | 7a317a5a14 |
12 | 3762231020 |
13 | 19c255c03b |
14 | c96d9bba8 |
15 | 74799c2b3 |
hex | 45b3f31d8 |
18710737368 has 64 divisors (see below), whose sum is σ = 48235461120. Its totient is φ = 6044448000.
The previous prime is 18710737349. The next prime is 18710737391. The reversal of 18710737368 is 86373701781.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 18710737368.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85621 + ... + 211547.
It is an arithmetic number, because the mean of its divisors is an integer number (753679080).
Almost surely, 218710737368 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 18710737368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24117730560).
18710737368 is an abundant number, since it is smaller than the sum of its proper divisors (29524723752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18710737368 is a wasteful number, since it uses less digits than its factorization.
18710737368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126128 (or 126124 counting only the distinct ones).
The product of its (nonzero) digits is 1185408, while the sum is 51.
The spelling of 18710737368 in words is "eighteen billion, seven hundred ten million, seven hundred thirty-seven thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •