Base | Representation |
---|---|
bin | 11111000000110110001… |
… | …001011001001101111101 |
3 | 21112202000211202210120011 |
4 | 133000312021121031331 |
5 | 234404210311223234 |
6 | 4311022042023221 |
7 | 306655265616334 |
oct | 37006611311575 |
9 | 7482024683504 |
10 | 2131212211069 |
11 | 751929807047 |
12 | 2a50627a7b11 |
13 | 125c84617456 |
14 | 75218d46d1b |
15 | 3a68748eb64 |
hex | 1f03625937d |
2131212211069 has 2 divisors, whose sum is σ = 2131212211070. Its totient is φ = 2131212211068.
The previous prime is 2131212211061. The next prime is 2131212211129. The reversal of 2131212211069 is 9601122121312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1467582027844 + 663630183225 = 1211438^2 + 814635^2 .
It is a cyclic number.
It is not a de Polignac number, because 2131212211069 - 23 = 2131212211061 is a prime.
It is a super-2 number, since 2×21312122110692 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2131212211069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2131212211061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065606105534 + 1065606105535.
It is an arithmetic number, because the mean of its divisors is an integer number (1065606105535).
Almost surely, 22131212211069 is an apocalyptic number.
It is an amenable number.
2131212211069 is a deficient number, since it is larger than the sum of its proper divisors (1).
2131212211069 is an equidigital number, since it uses as much as digits as its factorization.
2131212211069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 31.
The spelling of 2131212211069 in words is "two trillion, one hundred thirty-one billion, two hundred twelve million, two hundred eleven thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •