Base | Representation |
---|---|
bin | 11011000010111111… |
… | …00000011011011011 |
3 | 1101110221222102111001 |
4 | 31201133200123123 |
5 | 214214230114011 |
6 | 10400505445431 |
7 | 1022555435212 |
oct | 154137403333 |
9 | 41427872431 |
10 | 14520551131 |
11 | 6181521a89 |
12 | 2992aa0877 |
13 | 14a540b1b8 |
14 | 9ba69c079 |
15 | 59ebaa7c1 |
hex | 3617e06db |
14520551131 has 2 divisors, whose sum is σ = 14520551132. Its totient is φ = 14520551130.
The previous prime is 14520551119. The next prime is 14520551161. The reversal of 14520551131 is 13115502541.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14520551131 is a prime.
It is a super-2 number, since 2×145205511312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14520551131.
It is not a weakly prime, because it can be changed into another prime (14520551161) 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 as a sum of consecutive naturals, namely, 7260275565 + 7260275566.
It is an arithmetic number, because the mean of its divisors is an integer number (7260275566).
Almost surely, 214520551131 is an apocalyptic number.
14520551131 is a deficient number, since it is larger than the sum of its proper divisors (1).
14520551131 is an equidigital number, since it uses as much as digits as its factorization.
14520551131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3000, while the sum is 28.
The spelling of 14520551131 in words is "fourteen billion, five hundred twenty million, five hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •