Base | Representation |
---|---|
bin | 1000100110100101100110… |
… | …11100010110011000011111 |
3 | 2110222112210012010012012022 |
4 | 10103102303130112120133 |
5 | 4434423124402244314 |
6 | 104122455224130355 |
7 | 3661532554151501 |
oct | 423226334263037 |
9 | 73875705105168 |
10 | 18918046524959 |
11 | 603410a08638a |
12 | 215653b6069bb |
13 | a72c6c2787ca |
14 | 4958d1851d71 |
15 | 22c17d8cd78e |
hex | 1134b371661f |
18918046524959 has 2 divisors, whose sum is σ = 18918046524960. Its totient is φ = 18918046524958.
The previous prime is 18918046524929. The next prime is 18918046524989. The reversal of 18918046524959 is 95942564081981.
It is a balanced prime because it is at equal distance from previous prime (18918046524929) and next prime (18918046524989).
It is a cyclic number.
It is not a de Polignac number, because 18918046524959 - 244 = 1325860480543 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 18918046524892 and 18918046524901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (18918046524929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9459023262479 + 9459023262480.
It is an arithmetic number, because the mean of its divisors is an integer number (9459023262480).
Almost surely, 218918046524959 is an apocalyptic number.
18918046524959 is a deficient number, since it is larger than the sum of its proper divisors (1).
18918046524959 is an equidigital number, since it uses as much as digits as its factorization.
18918046524959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 223948800, while the sum is 71.
The spelling of 18918046524959 in words is "eighteen trillion, nine hundred eighteen billion, forty-six million, five hundred twenty-four thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •