Base | Representation |
---|---|
bin | 1001101001000110000110… |
… | …00011101101000110011001 |
3 | 2210002000020122001120102002 |
4 | 10310203003003231012121 |
5 | 10234343204130220322 |
6 | 113032344020250345 |
7 | 4315611555441305 |
oct | 464430303550631 |
9 | 83060218046362 |
10 | 21203231101337 |
11 | 683527020a40a |
12 | 24653b32409b5 |
13 | baa5c110960c |
14 | 534355948d05 |
15 | 26b828564c92 |
hex | 1348c30ed199 |
21203231101337 has 2 divisors, whose sum is σ = 21203231101338. Its totient is φ = 21203231101336.
The previous prime is 21203231101309. The next prime is 21203231101387. The reversal of 21203231101337 is 73310113230212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19931724534016 + 1271506567321 = 4464496^2 + 1127611^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21203231101337 is a prime.
It is a super-3 number, since 3×212032311013373 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (21203231101387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10601615550668 + 10601615550669.
It is an arithmetic number, because the mean of its divisors is an integer number (10601615550669).
Almost surely, 221203231101337 is an apocalyptic number.
It is an amenable number.
21203231101337 is a deficient number, since it is larger than the sum of its proper divisors (1).
21203231101337 is an equidigital number, since it uses as much as digits as its factorization.
21203231101337 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 29.
Adding to 21203231101337 its reverse (73310113230212), we get a palindrome (94513344331549).
The spelling of 21203231101337 in words is "twenty-one trillion, two hundred three billion, two hundred thirty-one million, one hundred one thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •