Base | Representation |
---|---|
bin | 100010101001111110011… |
… | …010001110010101011101 |
3 | 22102200011002220110011202 |
4 | 202221332122032111131 |
5 | 303004334331420121 |
6 | 5022021102325245 |
7 | 334026412552343 |
oct | 42517632162535 |
9 | 8380132813152 |
10 | 2381532685661 |
11 | 839003129628 |
12 | 325682589825 |
13 | 143767bc257c |
14 | 833a413b993 |
15 | 41e384ae40b |
hex | 22a7e68e55d |
2381532685661 has 2 divisors, whose sum is σ = 2381532685662. Its totient is φ = 2381532685660.
The previous prime is 2381532685627. The next prime is 2381532685687. The reversal of 2381532685661 is 1665862351832.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2372847564025 + 8685121636 = 1540405^2 + 93194^2 .
It is a cyclic number.
It is not a de Polignac number, because 2381532685661 - 214 = 2381532669277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2381532685597 and 2381532685606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2381532685601) 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, 1190766342830 + 1190766342831.
It is an arithmetic number, because the mean of its divisors is an integer number (1190766342831).
Almost surely, 22381532685661 is an apocalyptic number.
It is an amenable number.
2381532685661 is a deficient number, since it is larger than the sum of its proper divisors (1).
2381532685661 is an equidigital number, since it uses as much as digits as its factorization.
2381532685661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12441600, while the sum is 56.
The spelling of 2381532685661 in words is "two trillion, three hundred eighty-one billion, five hundred thirty-two million, six hundred eighty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •