Base | Representation |
---|---|
bin | 10000110011101110… |
… | …011001100111011110 |
3 | 1201120202212200000000 |
4 | 100303232121213132 |
5 | 243430200431000 |
6 | 12142504115130 |
7 | 1206144445614 |
oct | 206356314736 |
9 | 51522780000 |
10 | 18047670750 |
11 | 772149217a |
12 | 35b8165aa6 |
13 | 1918081725 |
14 | c32cb96b4 |
15 | 709673000 |
hex | 433b999de |
18047670750 has 144 divisors (see below), whose sum is σ = 50679890352. Its totient is φ = 4812274800.
The previous prime is 18047670721. The next prime is 18047670761. The reversal of 18047670750 is 5707674081.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 18047670696 and 18047670705.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1634749 + ... + 1645751.
It is an arithmetic number, because the mean of its divisors is an integer number (351943683).
Almost surely, 218047670750 is an apocalyptic number.
18047670750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 18047670750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25339945176).
18047670750 is an abundant number, since it is smaller than the sum of its proper divisors (32632219602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18047670750 is an frugal number, since it uses more digits than its factorization.
18047670750 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11044 (or 11013 counting only the distinct ones).
The product of its (nonzero) digits is 329280, while the sum is 45.
The spelling of 18047670750 in words is "eighteen billion, forty-seven million, six hundred seventy thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •