Base | Representation |
---|---|
bin | 100100011000100010100… |
… | …101100000000110010101 |
3 | 22212000120210202222120201 |
4 | 210120202211200012111 |
5 | 311431003303104141 |
6 | 5152333300500501 |
7 | 345431361510331 |
oct | 44304245400625 |
9 | 8760523688521 |
10 | 2500251222421 |
11 | 8843946a7417 |
12 | 3446950aa731 |
13 | 151a07762064 |
14 | 890271ca7c1 |
15 | 45085bd7031 |
hex | 24622960195 |
2500251222421 has 8 divisors (see below), whose sum is σ = 2505595207104. Its totient is φ = 2494908099360.
The previous prime is 2500251222407. The next prime is 2500251222437. The reversal of 2500251222421 is 1242221520052.
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 2500251222421 - 231 = 2498103738773 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2500251222421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2500251222121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5771826 + ... + 6189868.
It is an arithmetic number, because the mean of its divisors is an integer number (313199400888).
Almost surely, 22500251222421 is an apocalyptic number.
It is an amenable number.
2500251222421 is a deficient number, since it is larger than the sum of its proper divisors (5343984683).
2500251222421 is a wasteful number, since it uses less digits than its factorization.
2500251222421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430811.
The product of its (nonzero) digits is 6400, while the sum is 28.
Adding to 2500251222421 its reverse (1242221520052), we get a palindrome (3742472742473).
The spelling of 2500251222421 in words is "two trillion, five hundred billion, two hundred fifty-one million, two hundred twenty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •