Base | Representation |
---|---|
bin | 1011011011011010100011… |
… | …00100101010001000011111 |
3 | 10021222112002002022201221111 |
4 | 11231231101210222020133 |
5 | 11243222220341310101 |
6 | 125241042450042451 |
7 | 5202446054134045 |
oct | 555552144521037 |
9 | 107875062281844 |
10 | 25131222213151 |
11 | 800a10085153a |
12 | 299a723579427 |
13 | 1103b30520872 |
14 | 62c501542395 |
15 | 2d8ac2893251 |
hex | 16db5192a21f |
25131222213151 has 32 divisors (see below), whose sum is σ = 27565161523200. Its totient is φ = 22852725920640.
The previous prime is 25131222213137. The next prime is 25131222213169. The reversal of 25131222213151 is 15131222213152.
It is a cyclic number.
It is not a de Polignac number, because 25131222213151 - 27 = 25131222213023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25131222214151) 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 31 ways as a sum of consecutive naturals, for example, 2485885 + ... + 7512793.
It is an arithmetic number, because the mean of its divisors is an integer number (861411297600).
Almost surely, 225131222213151 is an apocalyptic number.
25131222213151 is a deficient number, since it is larger than the sum of its proper divisors (2433939310049).
25131222213151 is a wasteful number, since it uses less digits than its factorization.
25131222213151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5027119.
The product of its digits is 7200, while the sum is 31.
Subtracting from 25131222213151 its reverse (15131222213152), we obtain a palindrome (9999999999999).
The spelling of 25131222213151 in words is "twenty-five trillion, one hundred thirty-one billion, two hundred twenty-two million, two hundred thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •