Base | Representation |
---|---|
bin | 100101101001001110101100… |
… | …1111010010000110101000111 |
3 | 1121102101221210100102012122102 |
4 | 1023102131121322100311013 |
5 | 321400100340101140011 |
6 | 3132123204041222315 |
7 | 126513530066004641 |
oct | 11322353172206507 |
9 | 1542357710365572 |
10 | 331122012130631 |
11 | 96562069573067 |
12 | 311797b7a9199b |
13 | 1129b896b2a8a7 |
14 | 5baa5688a7891 |
15 | 284339b81173b |
hex | 12d2759e90d47 |
331122012130631 has 2 divisors, whose sum is σ = 331122012130632. Its totient is φ = 331122012130630.
The previous prime is 331122012130607. The next prime is 331122012130649. The reversal of 331122012130631 is 136031210221133.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 331122012130631 - 238 = 330847134223687 is a prime.
It is a super-2 number, since 2×3311220121306312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 331122012130594 and 331122012130603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331122012130661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165561006065315 + 165561006065316.
It is an arithmetic number, because the mean of its divisors is an integer number (165561006065316).
Almost surely, 2331122012130631 is an apocalyptic number.
331122012130631 is a deficient number, since it is larger than the sum of its proper divisors (1).
331122012130631 is an equidigital number, since it uses as much as digits as its factorization.
331122012130631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 29.
Adding to 331122012130631 its reverse (136031210221133), we get a palindrome (467153222351764).
The spelling of 331122012130631 in words is "three hundred thirty-one trillion, one hundred twenty-two billion, twelve million, one hundred thirty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •