Base | Representation |
---|---|
bin | 1000110000000001… |
… | …1101100000111011 |
3 | 20001200221001202022 |
4 | 2030000131200323 |
5 | 14302311244011 |
6 | 1025025425055 |
7 | 112131404501 |
oct | 21400354073 |
9 | 6050831668 |
10 | 2348931131 |
11 | aa5a017a8 |
12 | 55679b18b |
13 | 2b5847ba1 |
14 | 183d68671 |
15 | db3398db |
hex | 8c01d83b |
2348931131 has 2 divisors, whose sum is σ = 2348931132. Its totient is φ = 2348931130.
The previous prime is 2348931121. The next prime is 2348931161. The reversal of 2348931131 is 1311398432.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2348931131 is a prime.
It is a super-2 number, since 2×23489311312 = 11034954916361878322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2348931091 and 2348931100.
It is not a weakly prime, because it can be changed into another prime (2348931121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1174465565 + 1174465566.
It is an arithmetic number, because the mean of its divisors is an integer number (1174465566).
Almost surely, 22348931131 is an apocalyptic number.
2348931131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2348931131 is an equidigital number, since it uses as much as digits as its factorization.
2348931131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15552, while the sum is 35.
The square root of 2348931131 is about 48465.7727783226. The cubic root of 2348931131 is about 1329.3012952437.
The spelling of 2348931131 in words is "two billion, three hundred forty-eight million, nine hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •