Base | Representation |
---|---|
bin | 100101101001111000010010… |
… | …0011110101100000111011011 |
3 | 1121102201111021200011011100021 |
4 | 1023103300210132230013123 |
5 | 321403031230331220011 |
6 | 3132232213021051311 |
7 | 126523141011401566 |
oct | 11323604436540733 |
9 | 1542644250134307 |
10 | 331211310023131 |
11 | 96596a2293541a |
12 | 31192b796b6b37 |
13 | 112a7128353435 |
14 | 5bb09da43d4dd |
15 | 2845876201471 |
hex | 12d3c247ac1db |
331211310023131 has 2 divisors, whose sum is σ = 331211310023132. Its totient is φ = 331211310023130.
The previous prime is 331211310023081. The next prime is 331211310023149. The reversal of 331211310023131 is 131320013112133.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 331211310023131 - 213 = 331211310014939 is a prime.
It is a super-2 number, since 2×3312113100231312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 331211310023096 and 331211310023105.
It is not a weakly prime, because it can be changed into another prime (331211310623131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165605655011565 + 165605655011566.
It is an arithmetic number, because the mean of its divisors is an integer number (165605655011566).
Almost surely, 2331211310023131 is an apocalyptic number.
331211310023131 is a deficient number, since it is larger than the sum of its proper divisors (1).
331211310023131 is an equidigital number, since it uses as much as digits as its factorization.
331211310023131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 331211310023131 its reverse (131320013112133), we get a palindrome (462531323135264).
The spelling of 331211310023131 in words is "three hundred thirty-one trillion, two hundred eleven billion, three hundred ten million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •