Base | Representation |
---|---|
bin | 100100010000110111011… |
… | …111100010111010010101 |
3 | 22211020022121022120002022 |
4 | 210100313133202322111 |
5 | 311312120041014041 |
6 | 5144451534422525 |
7 | 345020244623606 |
oct | 44206737427225 |
9 | 8736277276068 |
10 | 2492012048021 |
11 | 88094691a781 |
12 | 342b75961a45 |
13 | 150cc37c9b32 |
14 | 88884c63dad |
15 | 44c526e524b |
hex | 244377e2e95 |
2492012048021 has 4 divisors (see below), whose sum is σ = 2494626961932. Its totient is φ = 2489397134112.
The previous prime is 2492012048011. The next prime is 2492012048047. The reversal of 2492012048021 is 1208402102942.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1389062602225 + 1102949445796 = 1178585^2 + 1050214^2 .
It is a cyclic number.
It is not a de Polignac number, because 2492012048021 - 222 = 2492007853717 is a prime.
It is a super-3 number, since 3×24920120480213 (a number of 38 digits) contains 333 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 (2492012048011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1307455526 + ... + 1307457431.
It is an arithmetic number, because the mean of its divisors is an integer number (623656740483).
Almost surely, 22492012048021 is an apocalyptic number.
It is an amenable number.
2492012048021 is a deficient number, since it is larger than the sum of its proper divisors (2614913911).
2492012048021 is an equidigital number, since it uses as much as digits as its factorization.
2492012048021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2614913910.
The product of its (nonzero) digits is 18432, while the sum is 35.
The spelling of 2492012048021 in words is "two trillion, four hundred ninety-two billion, twelve million, forty-eight thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •