Base | Representation |
---|---|
bin | 100010101101100100011… |
… | …110001011101010100101 |
3 | 22110001010002210110201001 |
4 | 202231210132023222211 |
5 | 303040240433423411 |
6 | 5023500103233301 |
7 | 334224151362634 |
oct | 42554436135245 |
9 | 8401102713631 |
10 | 2385392482981 |
11 | 83a703962472 |
12 | 32637b148831 |
13 | 143c31765601 |
14 | 8364c9d751b |
15 | 420b228cdc1 |
hex | 22b6478baa5 |
2385392482981 has 2 divisors, whose sum is σ = 2385392482982. Its totient is φ = 2385392482980.
The previous prime is 2385392482903. The next prime is 2385392482987. The reversal of 2385392482981 is 1892842935832.
2385392482981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2383889680225 + 1502802756 = 1543985^2 + 38766^2 .
It is a cyclic number.
It is not a de Polignac number, because 2385392482981 - 27 = 2385392482853 is a prime.
It is a super-2 number, since 2×23853924829812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2385392482987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1192696241490 + 1192696241491.
It is an arithmetic number, because the mean of its divisors is an integer number (1192696241491).
Almost surely, 22385392482981 is an apocalyptic number.
It is an amenable number.
2385392482981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2385392482981 is an equidigital number, since it uses as much as digits as its factorization.
2385392482981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 59719680, while the sum is 64.
The spelling of 2385392482981 in words is "two trillion, three hundred eighty-five billion, three hundred ninety-two million, four hundred eighty-two thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •