Base | Representation |
---|---|
bin | 101111111110011111111100… |
… | …111101111000010000010111 |
3 | 1000200002200220000001112002012 |
4 | 233332133330331320100113 |
5 | 210124033323210231411 |
6 | 2024433253112534435 |
7 | 62305320402650216 |
oct | 5776377475702027 |
9 | 1020080800045065 |
10 | 211003102430231 |
11 | 61260a05533a91 |
12 | 1b7b99940b141b |
13 | 909767937c167 |
14 | 3a1686722707d |
15 | 195da1ccc218b |
hex | bfe7fcf78417 |
211003102430231 has 2 divisors, whose sum is σ = 211003102430232. Its totient is φ = 211003102430230.
The previous prime is 211003102430221. The next prime is 211003102430279. The reversal of 211003102430231 is 132034201300112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211003102430231 - 234 = 210985922561047 is a prime.
It is a super-2 number, since 2×2110031024302312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211003102430197 and 211003102430206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211003102430221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105501551215115 + 105501551215116.
It is an arithmetic number, because the mean of its divisors is an integer number (105501551215116).
Almost surely, 2211003102430231 is an apocalyptic number.
211003102430231 is a deficient number, since it is larger than the sum of its proper divisors (1).
211003102430231 is an equidigital number, since it uses as much as digits as its factorization.
211003102430231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 211003102430231 its reverse (132034201300112), we get a palindrome (343037303730343).
The spelling of 211003102430231 in words is "two hundred eleven trillion, three billion, one hundred two million, four hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •