Base | Representation |
---|---|
bin | 1000111010010110… |
… | …1100001011110101 |
3 | 20011201102122011222 |
4 | 2032211230023311 |
5 | 14344403314411 |
6 | 1033214040125 |
7 | 113165514110 |
oct | 21645541365 |
9 | 6151378158 |
10 | 2392244981 |
11 | 10183a6075 |
12 | 5691a9045 |
13 | 2c1801b99 |
14 | 189a01577 |
15 | e00434db |
hex | 8e96c2f5 |
2392244981 has 8 divisors (see below), whose sum is σ = 2894817600. Its totient is φ = 1929878208.
The previous prime is 2392244969. The next prime is 2392245001. The reversal of 2392244981 is 1894422932.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2392244981 - 210 = 2392243957 is a prime.
It is a super-2 number, since 2×23922449812 = 11445672098239380722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2392244081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10051331 + ... + 10051568.
It is an arithmetic number, because the mean of its divisors is an integer number (361852200).
Almost surely, 22392244981 is an apocalyptic number.
It is an amenable number.
2392244981 is a deficient number, since it is larger than the sum of its proper divisors (502572619).
2392244981 is a wasteful number, since it uses less digits than its factorization.
2392244981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20102923.
The product of its digits is 248832, while the sum is 44.
The square root of 2392244981 is about 48910.5814829470. The cubic root of 2392244981 is about 1337.4222704529.
The spelling of 2392244981 in words is "two billion, three hundred ninety-two million, two hundred forty-four thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •