Base | Representation |
---|---|
bin | 100001111010111100110… |
… | …101011110101000010011 |
3 | 22020211211012210002110212 |
4 | 201322330311132220103 |
5 | 301142432321111011 |
6 | 4542510513514335 |
7 | 330261232364066 |
oct | 41727465365023 |
9 | 8224735702425 |
10 | 2331040410131 |
11 | 8196525a56a4 |
12 | 3179308729ab |
13 | 13ba7c173664 |
14 | 80b742a68dd |
15 | 409807ca08b |
hex | 21ebcd5ea13 |
2331040410131 has 2 divisors, whose sum is σ = 2331040410132. Its totient is φ = 2331040410130.
The previous prime is 2331040410071. The next prime is 2331040410151. The reversal of 2331040410131 is 1310140401332.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2331040410131 is a prime.
It is a super-2 number, since 2×23310404101312 (a number of 26 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 = 2331040410097 and 2331040410106.
It is not a weakly prime, because it can be changed into another prime (2331040410151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1165520205065 + 1165520205066.
It is an arithmetic number, because the mean of its divisors is an integer number (1165520205066).
Almost surely, 22331040410131 is an apocalyptic number.
2331040410131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2331040410131 is an equidigital number, since it uses as much as digits as its factorization.
2331040410131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 2331040410131 its reverse (1310140401332), we get a palindrome (3641180811463).
The spelling of 2331040410131 in words is "two trillion, three hundred thirty-one billion, forty million, four hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •