Base | Representation |
---|---|
bin | 1011100000010101100011… |
… | …11101101110100111100001 |
3 | 10022120200121102011002021010 |
4 | 11300022301331232213201 |
5 | 11304010100314404101 |
6 | 125450452302051133 |
7 | 5220614042140314 |
oct | 560126175564741 |
9 | 108520542132233 |
10 | 25300343122401 |
11 | 80748a7128826 |
12 | 2a07461879aa9 |
13 | 1116a732c24b9 |
14 | 63678654297b |
15 | 2dd1bee422d6 |
hex | 1702b1f6e9e1 |
25300343122401 has 8 divisors (see below), whose sum is σ = 33733837717504. Its totient is φ = 16866871971120.
The previous prime is 25300343122387. The next prime is 25300343122403. The reversal of 25300343122401 is 10422134300352.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 25300343122401 - 222 = 25300338928097 is a prime.
It is a super-2 number, since 2×253003431224012 (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 (25300343122403) 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, 3165790 + ... + 7786071.
It is an arithmetic number, because the mean of its divisors is an integer number (4216729714688).
Almost surely, 225300343122401 is an apocalyptic number.
It is an amenable number.
25300343122401 is a deficient number, since it is larger than the sum of its proper divisors (8433494595103).
25300343122401 is a wasteful number, since it uses less digits than its factorization.
25300343122401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11721911.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 25300343122401 its reverse (10422134300352), we get a palindrome (35722477422753).
The spelling of 25300343122401 in words is "twenty-five trillion, three hundred billion, three hundred forty-three million, one hundred twenty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •