Base | Representation |
---|---|
bin | 101111110011010001111001… |
… | …101100111000011101100111 |
3 | 1000120100222210120212102202121 |
4 | 233303101321230320131213 |
5 | 210023420320324411401 |
6 | 2023043143252450411 |
7 | 62165524306022254 |
oct | 5763217154703547 |
9 | 1016328716772677 |
10 | 210232101013351 |
11 | 60a93a2a311a6a |
12 | 1b6b4481319a07 |
13 | 903ca57182811 |
14 | 39cb40631042b |
15 | 1948945747ca1 |
hex | bf3479b38767 |
210232101013351 has 2 divisors, whose sum is σ = 210232101013352. Its totient is φ = 210232101013350.
The previous prime is 210232101013271. The next prime is 210232101013393. The reversal of 210232101013351 is 153310101232012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210232101013351 - 213 = 210232101005159 is a prime.
It is a super-2 number, since 2×2102321010133512 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210232101013651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105116050506675 + 105116050506676.
It is an arithmetic number, because the mean of its divisors is an integer number (105116050506676).
Almost surely, 2210232101013351 is an apocalyptic number.
210232101013351 is a deficient number, since it is larger than the sum of its proper divisors (1).
210232101013351 is an equidigital number, since it uses as much as digits as its factorization.
210232101013351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 210232101013351 its reverse (153310101232012), we get a palindrome (363542202245363).
The spelling of 210232101013351 in words is "two hundred ten trillion, two hundred thirty-two billion, one hundred one million, thirteen thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •