Base | Representation |
---|---|
bin | 10001100111100010… |
… | …000100101010011111 |
3 | 1210211100101202212012 |
4 | 101213202010222133 |
5 | 302220203320211 |
6 | 12405033501435 |
7 | 1236530416046 |
oct | 214742045237 |
9 | 53740352765 |
10 | 18916854431 |
11 | 80280867a2 |
12 | 37bb27187b |
13 | 1a261786b7 |
14 | cb64d355d |
15 | 75ab13d8b |
hex | 467884a9f |
18916854431 has 8 divisors (see below), whose sum is σ = 20072879424. Its totient is φ = 17765637120.
The previous prime is 18916854241. The next prime is 18916854487. The reversal of 18916854431 is 13445861981.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 18916854431 - 230 = 17843112607 is a prime.
It is a super-2 number, since 2×189168544312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 18916854431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18916854491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1193810 + ... + 1209551.
It is an arithmetic number, because the mean of its divisors is an integer number (2509109928).
Almost surely, 218916854431 is an apocalyptic number.
18916854431 is a deficient number, since it is larger than the sum of its proper divisors (1156024993).
18916854431 is a wasteful number, since it uses less digits than its factorization.
18916854431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2403841.
The product of its digits is 829440, while the sum is 50.
The spelling of 18916854431 in words is "eighteen billion, nine hundred sixteen million, eight hundred fifty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •