Base | Representation |
---|---|
bin | 10011110000011001… |
… | …100101111101111101 |
3 | 2000202101012122111222 |
4 | 103300121211331331 |
5 | 321421024011031 |
6 | 13424542323125 |
7 | 1350452314106 |
oct | 236031457575 |
9 | 60671178458 |
10 | 21213110141 |
11 | 8aa627a693 |
12 | 41402894a5 |
13 | 2000b0c4a2 |
14 | 10534693ad |
15 | 8424e5e7b |
hex | 4f0665f7d |
21213110141 has 2 divisors, whose sum is σ = 21213110142. Its totient is φ = 21213110140.
The previous prime is 21213110053. The next prime is 21213110147. The reversal of 21213110141 is 14101131212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14013587641 + 7199522500 = 118379^2 + 84850^2 .
It is a cyclic number.
It is not a de Polignac number, because 21213110141 - 226 = 21146001277 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21213110147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10606555070 + 10606555071.
It is an arithmetic number, because the mean of its divisors is an integer number (10606555071).
Almost surely, 221213110141 is an apocalyptic number.
It is an amenable number.
21213110141 is a deficient number, since it is larger than the sum of its proper divisors (1).
21213110141 is an equidigital number, since it uses as much as digits as its factorization.
21213110141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 21213110141 its reverse (14101131212), we get a palindrome (35314241353).
The spelling of 21213110141 in words is "twenty-one billion, two hundred thirteen million, one hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •