Base | Representation |
---|---|
bin | 1101001101100101010111… |
… | …0111100000100110110111 |
3 | 1220102202210000001101110212 |
4 | 3103121111313200212313 |
5 | 3401002314110304121 |
6 | 50521342034540035 |
7 | 3026354045463143 |
oct | 323312567404667 |
9 | 56382700041425 |
10 | 14527020009911 |
11 | 46a0969093492 |
12 | 176752573761b |
13 | 814b79c6a366 |
14 | 38317c022223 |
15 | 1a2d33c1a25b |
hex | d3655de09b7 |
14527020009911 has 2 divisors, whose sum is σ = 14527020009912. Its totient is φ = 14527020009910.
The previous prime is 14527020009877. The next prime is 14527020009959. The reversal of 14527020009911 is 11990002072541.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14527020009911 - 234 = 14509840140727 is a prime.
It is a super-2 number, since 2×145270200099112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14527020309911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7263510004955 + 7263510004956.
It is an arithmetic number, because the mean of its divisors is an integer number (7263510004956).
Almost surely, 214527020009911 is an apocalyptic number.
14527020009911 is a deficient number, since it is larger than the sum of its proper divisors (1).
14527020009911 is an equidigital number, since it uses as much as digits as its factorization.
14527020009911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 41.
The spelling of 14527020009911 in words is "fourteen trillion, five hundred twenty-seven billion, twenty million, nine thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •