Base | Representation |
---|---|
bin | 10010101110111100… |
… | …101111011000100001 |
3 | 1220220211222021022010 |
4 | 102232330233120201 |
5 | 312143421334424 |
6 | 13123554503133 |
7 | 1311316625004 |
oct | 225674573041 |
9 | 56824867263 |
10 | 20115027489 |
11 | 8592454967 |
12 | 3a94594aa9 |
13 | 1b8748043b |
14 | d8b6a953b |
15 | 7caddd229 |
hex | 4aef2f621 |
20115027489 has 16 divisors (see below), whose sum is σ = 27302002560. Its totient is φ = 13169717760.
The previous prime is 20115027481. The next prime is 20115027539. The reversal of 20115027489 is 98472051102.
It is not a de Polignac number, because 20115027489 - 23 = 20115027481 is a prime.
It is a super-2 number, since 2×201150274892 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20115027481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33457 + ... + 203345.
It is an arithmetic number, because the mean of its divisors is an integer number (1706375160).
Almost surely, 220115027489 is an apocalyptic number.
It is an amenable number.
20115027489 is a deficient number, since it is larger than the sum of its proper divisors (7186975071).
20115027489 is a wasteful number, since it uses less digits than its factorization.
20115027489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170600.
The product of its (nonzero) digits is 40320, while the sum is 39.
The spelling of 20115027489 in words is "twenty billion, one hundred fifteen million, twenty-seven thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •