Base | Representation |
---|---|
bin | 1011011110001011111001… |
… | …01001010011100010100011 |
3 | 10022022121211120100100211010 |
4 | 11233011330221103202203 |
5 | 11301302214114212011 |
6 | 125352510331552003 |
7 | 5212356361113501 |
oct | 557057451234243 |
9 | 108277746310733 |
10 | 25226434132131 |
11 | 804651a463491 |
12 | 29b50758bb603 |
13 | 110cac506cb6b |
14 | 632d74707671 |
15 | 2db2e65871a6 |
hex | 16f17ca538a3 |
25226434132131 has 16 divisors (see below), whose sum is σ = 34795232883360. Its totient is φ = 16237634112000.
The previous prime is 25226434132127. The next prime is 25226434132181. The reversal of 25226434132131 is 13123143462252.
It is a happy number.
It is not a de Polignac number, because 25226434132131 - 22 = 25226434132127 is a prime.
It is a super-2 number, since 2×252264341321312 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 25226434132131.
It is not an unprimeable number, because it can be changed into a prime (25226434132181) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25839381 + ... + 26797881.
It is an arithmetic number, because the mean of its divisors is an integer number (2174702055210).
Almost surely, 225226434132131 is an apocalyptic number.
25226434132131 is a deficient number, since it is larger than the sum of its proper divisors (9568798751229).
25226434132131 is a wasteful number, since it uses less digits than its factorization.
25226434132131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1261046.
The product of its digits is 207360, while the sum is 39.
Adding to 25226434132131 its reverse (13123143462252), we get a palindrome (38349577594383).
The spelling of 25226434132131 in words is "twenty-five trillion, two hundred twenty-six billion, four hundred thirty-four million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •