Base | Representation |
---|---|
bin | 1001101001000100000010… |
… | …11100000110011001010111 |
3 | 2210001220101220111222220002 |
4 | 10310202001130012121113 |
5 | 10234333430312401101 |
6 | 113032042452201515 |
7 | 4315542360102665 |
oct | 464420134063127 |
9 | 83056356458802 |
10 | 21202130200151 |
11 | 683485583a01a |
12 | 246514660929b |
13 | baa4770016b4 |
14 | 53428d653c35 |
15 | 26b7b1aa1d6b |
hex | 134881706657 |
21202130200151 has 2 divisors, whose sum is σ = 21202130200152. Its totient is φ = 21202130200150.
The previous prime is 21202130200127. The next prime is 21202130200171. The reversal of 21202130200151 is 15100203120212.
It is an a-pointer prime, because the next prime (21202130200171) can be obtained adding 21202130200151 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21202130200151 - 222 = 21202126005847 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21202130200171) 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, 10601065100075 + 10601065100076.
It is an arithmetic number, because the mean of its divisors is an integer number (10601065100076).
Almost surely, 221202130200151 is an apocalyptic number.
21202130200151 is a deficient number, since it is larger than the sum of its proper divisors (1).
21202130200151 is an equidigital number, since it uses as much as digits as its factorization.
21202130200151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 21202130200151 its reverse (15100203120212), we get a palindrome (36302333320363).
The spelling of 21202130200151 in words is "twenty-one trillion, two hundred two billion, one hundred thirty million, two hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •