Base | Representation |
---|---|
bin | 10111100001010100… |
… | …111111010001000111 |
3 | 2102012002010201000001 |
4 | 113201110333101013 |
5 | 403210313241403 |
6 | 15334014502131 |
7 | 1552563521662 |
oct | 274124772107 |
9 | 72162121001 |
10 | 25255212103 |
11 | a78a9aa720 |
12 | 4a89b04947 |
13 | 24c63823b4 |
14 | 131821c6d9 |
15 | 9cc2d5c1d |
hex | 5e153f447 |
25255212103 has 8 divisors (see below), whose sum is σ = 28223120016. Its totient is φ = 22399300800.
The previous prime is 25255212097. The next prime is 25255212109. The reversal of 25255212103 is 30121255252.
It is an interprime number because it is at equal distance from previous prime (25255212097) and next prime (25255212109).
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 25255212103 - 29 = 25255211591 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 (25255212109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27998676 + ... + 27999577.
It is an arithmetic number, because the mean of its divisors is an integer number (3527890002).
Almost surely, 225255212103 is an apocalyptic number.
25255212103 is a deficient number, since it is larger than the sum of its proper divisors (2967907913).
25255212103 is a wasteful number, since it uses less digits than its factorization.
25255212103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55998305.
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 25255212103 its reverse (30121255252), we get a palindrome (55376467355).
The spelling of 25255212103 in words is "twenty-five billion, two hundred fifty-five million, two hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •