Base | Representation |
---|---|
bin | 10011010000000000000001… |
… | …11100000101010111111111 |
3 | 12112212211021001020220202102 |
4 | 21220000000330011113333 |
5 | 21022023311113420111 |
6 | 230010405130215315 |
7 | 11626220634133634 |
oct | 1150000074052777 |
9 | 175784231226672 |
10 | 42331213420031 |
11 | 12540626448658 |
12 | 48b80a588453b |
13 | 1a80a7c535433 |
14 | a64bad73a18b |
15 | 4d61ea7be13b |
hex | 268000f055ff |
42331213420031 has 2 divisors, whose sum is σ = 42331213420032. Its totient is φ = 42331213420030.
The previous prime is 42331213420009. The next prime is 42331213420049. The reversal of 42331213420031 is 13002431213324.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 42331213420031 - 26 = 42331213419967 is a prime.
It is a super-2 number, since 2×423312134200312 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 42331213419976 and 42331213420003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42331213420831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21165606710015 + 21165606710016.
It is an arithmetic number, because the mean of its divisors is an integer number (21165606710016).
Almost surely, 242331213420031 is an apocalyptic number.
42331213420031 is a deficient number, since it is larger than the sum of its proper divisors (1).
42331213420031 is an equidigital number, since it uses as much as digits as its factorization.
42331213420031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 42331213420031 its reverse (13002431213324), we get a palindrome (55333644633355).
The spelling of 42331213420031 in words is "forty-two trillion, three hundred thirty-one billion, two hundred thirteen million, four hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •