Base | Representation |
---|---|
bin | 1011100001100111011101… |
… | …10101010111010111001111 |
3 | 10022201220002211010202210210 |
4 | 11300303232311113113033 |
5 | 11310220123341410020 |
6 | 125523003410533503 |
7 | 5224031504426115 |
oct | 560635665272717 |
9 | 108656084122723 |
10 | 25344314013135 |
11 | 8091510598847 |
12 | 2a13a93597293 |
13 | 111ac5cc43a40 |
14 | 638958247ab5 |
15 | 2de3e534e3e0 |
hex | 170ceed575cf |
25344314013135 has 32 divisors (see below), whose sum is σ = 43671071001600. Its totient is φ = 12476952632448.
The previous prime is 25344314013103. The next prime is 25344314013181. The reversal of 25344314013135 is 53131041344352.
It is not a de Polignac number, because 25344314013135 - 25 = 25344314013103 is a prime.
It is a super-2 number, since 2×253443140131352 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 25344314013093 and 25344314013102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8738266 + ... + 11271464.
It is an arithmetic number, because the mean of its divisors is an integer number (1364720968800).
Almost surely, 225344314013135 is an apocalyptic number.
25344314013135 is a deficient number, since it is larger than the sum of its proper divisors (18326756988465).
25344314013135 is a wasteful number, since it uses less digits than its factorization.
25344314013135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2584527.
The product of its (nonzero) digits is 259200, while the sum is 39.
Adding to 25344314013135 its reverse (53131041344352), we get a palindrome (78475355357487).
The spelling of 25344314013135 in words is "twenty-five trillion, three hundred forty-four billion, three hundred fourteen million, thirteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •