Base | Representation |
---|---|
bin | 10011100011101101… |
… | …001001001110111111 |
3 | 2000012112110012202212 |
4 | 103203231021032333 |
5 | 321002013202034 |
6 | 13351453411035 |
7 | 1342255113143 |
oct | 234355111677 |
9 | 60175405685 |
10 | 21000131519 |
11 | 89a70326a4 |
12 | 40a0a99a7b |
13 | 1c9895c933 |
14 | 1033069223 |
15 | 82d9762ce |
hex | 4e3b493bf |
21000131519 has 2 divisors, whose sum is σ = 21000131520. Its totient is φ = 21000131518.
The previous prime is 21000131461. The next prime is 21000131563. The reversal of 21000131519 is 91513100012.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21000131519 is a prime.
It is a super-2 number, since 2×210001315192 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21000131494 and 21000131503.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21000131599) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10500065759 + 10500065760.
It is an arithmetic number, because the mean of its divisors is an integer number (10500065760).
Almost surely, 221000131519 is an apocalyptic number.
21000131519 is a deficient number, since it is larger than the sum of its proper divisors (1).
21000131519 is an equidigital number, since it uses as much as digits as its factorization.
21000131519 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 23.
The spelling of 21000131519 in words is "twenty-one billion, one hundred thirty-one thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •