Base | Representation |
---|---|
bin | 1000100110010010101110… |
… | …00111100010000000010100 |
3 | 2110221120121120222220201222 |
4 | 10103021113013202000110 |
5 | 4434241343323112301 |
6 | 104114101200305512 |
7 | 3661023402025334 |
oct | 423112707420024 |
9 | 73846546886658 |
10 | 18907907629076 |
11 | 602a886a23894 |
12 | 2154590012298 |
13 | a7201487972b |
14 | 49520d0950c4 |
15 | 22bc8873631b |
hex | 1132571e2014 |
18907907629076 has 12 divisors (see below), whose sum is σ = 33554878328160. Its totient is φ = 9320799535320.
The previous prime is 18907907629019. The next prime is 18907907629111. The reversal of 18907907629076 is 67092670970981.
It is a super-2 number, since 2×189079076290762 (a number of 27 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (71) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (71).
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 33288569486 + ... + 33288570053.
It is an arithmetic number, because the mean of its divisors is an integer number (2796239860680).
Almost surely, 218907907629076 is an apocalyptic number.
It is an amenable number.
18907907629076 is a deficient number, since it is larger than the sum of its proper divisors (14646970699084).
18907907629076 is a wasteful number, since it uses less digits than its factorization.
18907907629076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66577139614 (or 66577139612 counting only the distinct ones).
The product of its (nonzero) digits is 144027072, while the sum is 71.
The spelling of 18907907629076 in words is "eighteen trillion, nine hundred seven billion, nine hundred seven million, six hundred twenty-nine thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •