Base | Representation |
---|---|
bin | 1010100011100000010001… |
… | …10011111111000111110111 |
3 | 10001011212110100010110002002 |
4 | 11101300020303333013313 |
5 | 11020233342141110312 |
6 | 121210332441205515 |
7 | 4613610116202152 |
oct | 521601063770767 |
9 | 101155410113062 |
10 | 23210151113207 |
11 | 7439408241573 |
12 | 272a34879089b |
13 | cc492821ba66 |
14 | 5a353d492c99 |
15 | 2a3b38d0b4c2 |
hex | 151c08cff1f7 |
23210151113207 has 2 divisors, whose sum is σ = 23210151113208. Its totient is φ = 23210151113206.
The previous prime is 23210151113173. The next prime is 23210151113273. The reversal of 23210151113207 is 70231115101232.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23210151113207 - 214 = 23210151096823 is a prime.
It is a super-2 number, since 2×232101511132072 (a number of 28 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 23210151113207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23210351113207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11605075556603 + 11605075556604.
It is an arithmetic number, because the mean of its divisors is an integer number (11605075556604).
Almost surely, 223210151113207 is an apocalyptic number.
23210151113207 is a deficient number, since it is larger than the sum of its proper divisors (1).
23210151113207 is an equidigital number, since it uses as much as digits as its factorization.
23210151113207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 29.
Adding to 23210151113207 its reverse (70231115101232), we get a palindrome (93441266214439).
The spelling of 23210151113207 in words is "twenty-three trillion, two hundred ten billion, one hundred fifty-one million, one hundred thirteen thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •