Base | Representation |
---|---|
bin | 1000101100011110… |
… | …0010111011111011 |
3 | 20000122212001100201 |
4 | 2023013202323323 |
5 | 14240001324011 |
6 | 1023333543031 |
7 | 111560524114 |
oct | 21307427373 |
9 | 6018761321 |
10 | 2334011131 |
11 | a98541121 |
12 | 5517a4a77 |
13 | 2b2722a9a |
14 | 181da320b |
15 | d9d8dcc1 |
hex | 8b1e2efb |
2334011131 has 2 divisors, whose sum is σ = 2334011132. Its totient is φ = 2334011130.
The previous prime is 2334011093. The next prime is 2334011137. The reversal of 2334011131 is 1311104332.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2334011131 - 215 = 2333978363 is a prime.
It is a super-3 number, since 3×23340111313 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 2334011099 and 2334011108.
It is not a weakly prime, because it can be changed into another prime (2334011137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1167005565 + 1167005566.
It is an arithmetic number, because the mean of its divisors is an integer number (1167005566).
Almost surely, 22334011131 is an apocalyptic number.
2334011131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2334011131 is an equidigital number, since it uses as much as digits as its factorization.
2334011131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 2334011131 is about 48311.6045169274. The cubic root of 2334011131 is about 1326.4808185649.
Adding to 2334011131 its reverse (1311104332), we get a palindrome (3645115463).
The spelling of 2334011131 in words is "two billion, three hundred thirty-four million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •