Base | Representation |
---|---|
bin | 1001010100100010… |
… | …0101000010000101 |
3 | 20110101001111212110 |
4 | 2111020211002011 |
5 | 20111011212041 |
6 | 1052135411233 |
7 | 116001052065 |
oct | 22510450205 |
9 | 6411044773 |
10 | 2502054021 |
11 | 1074387245 |
12 | 599b23b19 |
13 | 30b49b34c |
14 | 19a4273a5 |
15 | e99d4516 |
hex | 95225085 |
2502054021 has 4 divisors (see below), whose sum is σ = 3336072032. Its totient is φ = 1668036012.
The previous prime is 2502054017. The next prime is 2502054059. The reversal of 2502054021 is 1204502052.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2502054021 - 22 = 2502054017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2502054221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 417009001 + ... + 417009006.
It is an arithmetic number, because the mean of its divisors is an integer number (834018008).
Almost surely, 22502054021 is an apocalyptic number.
It is an amenable number.
2502054021 is a deficient number, since it is larger than the sum of its proper divisors (834018011).
2502054021 is an equidigital number, since it uses as much as digits as its factorization.
2502054021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 834018010.
The product of its (nonzero) digits is 800, while the sum is 21.
The square root of 2502054021 is about 50020.5359927300. The cubic root of 2502054021 is about 1357.5804045996.
Adding to 2502054021 its reverse (1204502052), we get a palindrome (3706556073).
The spelling of 2502054021 in words is "two billion, five hundred two million, fifty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •