Base | Representation |
---|---|
bin | 11110110001111101100… |
… | …100000000100101101111 |
3 | 21111012210001100211010222 |
4 | 132301331210000211233 |
5 | 234123443002014411 |
6 | 4255420134321555 |
7 | 305551245414161 |
oct | 36617544004557 |
9 | 7435701324128 |
10 | 2115230501231 |
11 | 746078523991 |
12 | 2a1b424b92bb |
13 | 124608596303 |
14 | 745405b6931 |
15 | 3a04e3ad4db |
hex | 1ec7d90096f |
2115230501231 has 2 divisors, whose sum is σ = 2115230501232. Its totient is φ = 2115230501230.
The previous prime is 2115230501203. The next prime is 2115230501233. The reversal of 2115230501231 is 1321050325112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2115230501231 - 226 = 2115163392367 is a prime.
It is a super-2 number, since 2×21152305012312 (a number of 25 digits) contains 22 as substring.
Together with 2115230501233, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2115230501231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2115230501233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1057615250615 + 1057615250616.
It is an arithmetic number, because the mean of its divisors is an integer number (1057615250616).
Almost surely, 22115230501231 is an apocalyptic number.
2115230501231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2115230501231 is an equidigital number, since it uses as much as digits as its factorization.
2115230501231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 2115230501231 its reverse (1321050325112), we get a palindrome (3436280826343).
The spelling of 2115230501231 in words is "two trillion, one hundred fifteen billion, two hundred thirty million, five hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •