Base | Representation |
---|---|
bin | 1001101001010110101000… |
… | …10011001010111111111111 |
3 | 2210002212011102211202120111 |
4 | 10310223110103022333333 |
5 | 10240014400214200411 |
6 | 113040413044330451 |
7 | 4316344603425301 |
oct | 464532423127777 |
9 | 83085142752514 |
10 | 21212110303231 |
11 | 68390072a41a1 |
12 | 24670709a3a27 |
13 | bab3a7843633 |
14 | 534958cb7971 |
15 | 26bb97d2e721 |
hex | 134ad44cafff |
21212110303231 has 2 divisors, whose sum is σ = 21212110303232. Its totient is φ = 21212110303230.
The previous prime is 21212110303229. The next prime is 21212110303259. The reversal of 21212110303231 is 13230301121212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21212110303231 - 21 = 21212110303229 is a prime.
It is a super-3 number, since 3×212121103032313 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 21212110303229, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21212110303261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10606055151615 + 10606055151616.
It is an arithmetic number, because the mean of its divisors is an integer number (10606055151616).
Almost surely, 221212110303231 is an apocalyptic number.
21212110303231 is a deficient number, since it is larger than the sum of its proper divisors (1).
21212110303231 is an equidigital number, since it uses as much as digits as its factorization.
21212110303231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 21212110303231 its reverse (13230301121212), we get a palindrome (34442411424443).
The spelling of 21212110303231 in words is "twenty-one trillion, two hundred twelve billion, one hundred ten million, three hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •