Base | Representation |
---|---|
bin | 10001011010010011… |
… | …100010100000101000 |
3 | 1210020212211101110120 |
4 | 101122103202200220 |
5 | 301241401100322 |
6 | 12331025243240 |
7 | 1231164242220 |
oct | 213223424050 |
9 | 53225741416 |
10 | 18694940712 |
11 | 7a23896728 |
12 | 3758a93520 |
13 | 19bc1babc6 |
14 | c94c49080 |
15 | 7463cba5c |
hex | 45a4e2828 |
18694940712 has 256 divisors, whose sum is σ = 59415552000. Its totient is φ = 4780726272.
The previous prime is 18694940669. The next prime is 18694940713. The reversal of 18694940712 is 21704949681.
It is not an unprimeable number, because it can be changed into a prime (18694940713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4348548 + ... + 4352844.
It is an arithmetic number, because the mean of its divisors is an integer number (232092000).
Almost surely, 218694940712 is an apocalyptic number.
18694940712 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 18694940712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29707776000).
18694940712 is an abundant number, since it is smaller than the sum of its proper divisors (40720611288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18694940712 is a wasteful number, since it uses less digits than its factorization.
18694940712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4408 (or 4404 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 51.
The spelling of 18694940712 in words is "eighteen billion, six hundred ninety-four million, nine hundred forty thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •