Base | Representation |
---|---|
bin | 10001101001001110… |
… | …000010111110100000 |
3 | 1210220022122210112020 |
4 | 101221032002332200 |
5 | 302244430042242 |
6 | 12411524301440 |
7 | 1240323123630 |
oct | 215116027640 |
9 | 53808583466 |
10 | 18945159072 |
11 | 8042059464 |
12 | 3808841880 |
13 | 1a2bca8ac8 |
14 | cba1806c0 |
15 | 75d3556ec |
hex | 469382fa0 |
18945159072 has 96 divisors (see below), whose sum is σ = 57073766400. Its totient is φ = 5390208768.
The previous prime is 18945159067. The next prime is 18945159073. The reversal of 18945159072 is 27095154981.
It is a tau number, because it is divible by the number of its divisors (96).
It is not an unprimeable number, because it can be changed into a prime (18945159073) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 101629 + ... + 219587.
It is an arithmetic number, because the mean of its divisors is an integer number (594518400).
Almost surely, 218945159072 is an apocalyptic number.
18945159072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 18945159072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28536883200).
18945159072 is an abundant number, since it is smaller than the sum of its proper divisors (38128607328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18945159072 is a wasteful number, since it uses less digits than its factorization.
18945159072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118218 (or 118210 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 51.
The spelling of 18945159072 in words is "eighteen billion, nine hundred forty-five million, one hundred fifty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •