Base | Representation |
---|---|
bin | 1001110010001001000010… |
… | …10011110000000101110011 |
3 | 2211011201112010200011211212 |
4 | 10321010201103300011303 |
5 | 10304441233300332012 |
6 | 113431230152230335 |
7 | 4350224133542054 |
oct | 471044123600563 |
9 | 84151463604755 |
10 | 21514050011507 |
11 | 694506a3a7a89 |
12 | 24b569799b3ab |
13 | c009c6499901 |
14 | 5453dd89c72b |
15 | 27496a941b22 |
hex | 1391214f0173 |
21514050011507 has 2 divisors, whose sum is σ = 21514050011508. Its totient is φ = 21514050011506.
The previous prime is 21514050011473. The next prime is 21514050011513. The reversal of 21514050011507 is 70511005041512.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21514050011507 - 230 = 21512976269683 is a prime.
It is a super-2 number, since 2×215140500115072 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21514050011527) 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, 10757025005753 + 10757025005754.
It is an arithmetic number, because the mean of its divisors is an integer number (10757025005754).
Almost surely, 221514050011507 is an apocalyptic number.
21514050011507 is a deficient number, since it is larger than the sum of its proper divisors (1).
21514050011507 is an equidigital number, since it uses as much as digits as its factorization.
21514050011507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7000, while the sum is 32.
The spelling of 21514050011507 in words is "twenty-one trillion, five hundred fourteen billion, fifty million, eleven thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •