Base | Representation |
---|---|
bin | 101011111111100000101… |
… | …010010111011000011101 |
3 | 101201000020012201120002111 |
4 | 223333200222113120131 |
5 | 344012333042230133 |
6 | 10232450213354021 |
7 | 431262003210634 |
oct | 53774052273035 |
9 | 11630205646074 |
10 | 3023131211293 |
11 | a66114835126 |
12 | 409aa0638911 |
13 | 18c106b3cc8b |
14 | a646adbc51b |
15 | 5398a3211cd |
hex | 2bfe0a9761d |
3023131211293 has 2 divisors, whose sum is σ = 3023131211294. Its totient is φ = 3023131211292.
The previous prime is 3023131211279. The next prime is 3023131211329. The reversal of 3023131211293 is 3921121313203.
It is a happy number.
Together with next prime (3023131211329) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2103781995364 + 919349215929 = 1450442^2 + 958827^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3023131211293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3023131211203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1511565605646 + 1511565605647.
It is an arithmetic number, because the mean of its divisors is an integer number (1511565605647).
Almost surely, 23023131211293 is an apocalyptic number.
It is an amenable number.
3023131211293 is a deficient number, since it is larger than the sum of its proper divisors (1).
3023131211293 is an equidigital number, since it uses as much as digits as its factorization.
3023131211293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 31.
Adding to 3023131211293 its reverse (3921121313203), we get a palindrome (6944252524496).
The spelling of 3023131211293 in words is "three trillion, twenty-three billion, one hundred thirty-one million, two hundred eleven thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •