Base | Representation |
---|---|
bin | 1000011010100010011010… |
… | …10011110101110011111011 |
3 | 2102111222002200221022220211 |
4 | 10031101031103311303323 |
5 | 4411132211114023242 |
6 | 103204343324331551 |
7 | 3616604525124415 |
oct | 415211523656373 |
9 | 72458080838824 |
10 | 18504016157947 |
11 | 59945667a4651 |
12 | 20aa2516a3bb7 |
13 | a42bc8c58568 |
14 | 47d85614d9b5 |
15 | 2214ea3a4317 |
hex | 10d44d4f5cfb |
18504016157947 has 8 divisors (see below), whose sum is σ = 19238249055312. Its totient is φ = 17783255424000.
The previous prime is 18504016157911. The next prime is 18504016158037. The reversal of 18504016157947 is 74975161040581.
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 18504016157947 - 231 = 18501868674299 is a prime.
It is a super-2 number, since 2×185040161579472 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 18504016157891 and 18504016157900.
It is not an unprimeable number, because it can be changed into a prime (18504016157147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3368038054 + ... + 3368043547.
It is an arithmetic number, because the mean of its divisors is an integer number (2404781131914).
Almost surely, 218504016157947 is an apocalyptic number.
18504016157947 is a deficient number, since it is larger than the sum of its proper divisors (734232897365).
18504016157947 is an equidigital number, since it uses as much as digits as its factorization.
18504016157947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6736081709.
The product of its (nonzero) digits is 8467200, while the sum is 58.
The spelling of 18504016157947 in words is "eighteen trillion, five hundred four billion, sixteen million, one hundred fifty-seven thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •