Base | Representation |
---|---|
bin | 1011011110000000011111… |
… | …11010101110000000000011 |
3 | 10022022001001010010220120210 |
4 | 11233000033322232000003 |
5 | 11301202201120404443 |
6 | 125350015222005203 |
7 | 5212051626343416 |
oct | 557001772560003 |
9 | 108261033126523 |
10 | 25220315013123 |
11 | 804396a37283a |
12 | 29b3a48576803 |
13 | 110c35b3c8199 |
14 | 632953b6bb7d |
15 | 2db08926ec33 |
hex | 16f00feae003 |
25220315013123 has 8 divisors (see below), whose sum is σ = 34052746009600. Its totient is φ = 16600713679368.
The previous prime is 25220315013077. The next prime is 25220315013149. The reversal of 25220315013123 is 32131051302252.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-25220315013123 is a prime.
It is a super-2 number, since 2×252203150131232 (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 (25220315015123) 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, 53207415403 + ... + 53207415876.
It is an arithmetic number, because the mean of its divisors is an integer number (4256593251200).
Almost surely, 225220315013123 is an apocalyptic number.
25220315013123 is a deficient number, since it is larger than the sum of its proper divisors (8832430996477).
25220315013123 is a wasteful number, since it uses less digits than its factorization.
25220315013123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106414831361.
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 25220315013123 its reverse (32131051302252), we get a palindrome (57351366315375).
The spelling of 25220315013123 in words is "twenty-five trillion, two hundred twenty billion, three hundred fifteen million, thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •