Base | Representation |
---|---|
bin | 1011011110000001111000… |
… | …00010101111110010101001 |
3 | 10022022002221201011011000000 |
4 | 11233000330002233302221 |
5 | 11301210210130040423 |
6 | 125350220505133213 |
7 | 5212106155661310 |
oct | 557007402576251 |
9 | 108262851134000 |
10 | 25221055315113 |
11 | 804420a239669 |
12 | 29b401448a209 |
13 | 110c4488a86b8 |
14 | 6329c41d7277 |
15 | 2db0ce253843 |
hex | 16f03c0afca9 |
25221055315113 has 28 divisors (see below), whose sum is σ = 43216325243968. Its totient is φ = 14412031605720.
The previous prime is 25221055315063. The next prime is 25221055315121. The reversal of 25221055315113 is 31151355012252.
25221055315113 is a `hidden beast` number, since 2 + 5 + 2 + 2 + 1 + 0 + 5 + 531 + 5 + 113 = 666.
It is not a de Polignac number, because 25221055315113 - 28 = 25221055314857 is a prime.
It is a super-2 number, since 2×252210553151132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (25221055315123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 2471193733 + ... + 2471203938.
Almost surely, 225221055315113 is an apocalyptic number.
It is an amenable number.
25221055315113 is a deficient number, since it is larger than the sum of its proper divisors (17995269928855).
25221055315113 is an frugal number, since it uses more digits than its factorization.
25221055315113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4942397696 (or 4942397681 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 36.
The spelling of 25221055315113 in words is "twenty-five trillion, two hundred twenty-one billion, fifty-five million, three hundred fifteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •