Base | Representation |
---|---|
bin | 100001111100001001101… |
… | …101010111111010100011 |
3 | 22020222011002121201001102 |
4 | 201330021231113322203 |
5 | 301203103003143412 |
6 | 4543242505025015 |
7 | 330335213003414 |
oct | 41741155277243 |
9 | 8228132551042 |
10 | 2332330131107 |
11 | 81a1546120a9 |
12 | 31803078516b |
13 | 13bc2641ca72 |
14 | 80c576ad80b |
15 | 40a08b398c2 |
hex | 21f09b57ea3 |
2332330131107 has 2 divisors, whose sum is σ = 2332330131108. Its totient is φ = 2332330131106.
The previous prime is 2332330131073. The next prime is 2332330131149. The reversal of 2332330131107 is 7011310332332.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2332330131107 - 218 = 2332329868963 is a prime.
It is a super-3 number, since 3×23323301311073 (a number of 38 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2332330131107.
It is not a weakly prime, because it can be changed into another prime (2332330131007) 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, 1166165065553 + 1166165065554.
It is an arithmetic number, because the mean of its divisors is an integer number (1166165065554).
Almost surely, 22332330131107 is an apocalyptic number.
2332330131107 is a deficient number, since it is larger than the sum of its proper divisors (1).
2332330131107 is an equidigital number, since it uses as much as digits as its factorization.
2332330131107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 29.
Adding to 2332330131107 its reverse (7011310332332), we get a palindrome (9343640463439).
The spelling of 2332330131107 in words is "two trillion, three hundred thirty-two billion, three hundred thirty million, one hundred thirty-one thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •