Base | Representation |
---|---|
bin | 1101001101001111000011… |
… | …0101011100000101110011 |
3 | 1220102012022112210102000101 |
4 | 3103103300311130011303 |
5 | 3400403032140013021 |
6 | 50514511420133231 |
7 | 3026052442316302 |
oct | 323236065340563 |
9 | 56365275712011 |
10 | 14521030001011 |
11 | 4699374967106 |
12 | 1766333697217 |
13 | 814433c8c0b1 |
14 | 382b70694439 |
15 | 1a2ad2e07a91 |
hex | d34f0d5c173 |
14521030001011 has 2 divisors, whose sum is σ = 14521030001012. Its totient is φ = 14521030001010.
The previous prime is 14521030000979. The next prime is 14521030001033. The reversal of 14521030001011 is 11010003012541.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14521030001011 - 25 = 14521030000979 is a prime.
It is a super-2 number, since 2×145210300010112 (a number of 27 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 14521030001011.
It is not a weakly prime, because it can be changed into another prime (14521030001041) 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, 7260515000505 + 7260515000506.
It is an arithmetic number, because the mean of its divisors is an integer number (7260515000506).
Almost surely, 214521030001011 is an apocalyptic number.
14521030001011 is a deficient number, since it is larger than the sum of its proper divisors (1).
14521030001011 is an equidigital number, since it uses as much as digits as its factorization.
14521030001011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 14521030001011 its reverse (11010003012541), we get a palindrome (25531033013552).
The spelling of 14521030001011 in words is "fourteen trillion, five hundred twenty-one billion, thirty million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •