Base | Representation |
---|---|
bin | 11101110110110101010… |
… | …11010110001001000111 |
3 | 10122001221201022000201100 |
4 | 32323122223112021013 |
5 | 113301440434344143 |
6 | 2103140104031143 |
7 | 134055016505145 |
oct | 16733253261107 |
9 | 3561851260640 |
10 | 1025871012423 |
11 | 3660844954a4 |
12 | 1469a21624b3 |
13 | 7597c0b950a |
14 | 3791c362595 |
15 | 1ba42b3b6d3 |
hex | eedaad6247 |
1025871012423 has 48 divisors (see below), whose sum is σ = 1528383272416. Its totient is φ = 662583317760.
The previous prime is 1025871012409. The next prime is 1025871012427. The reversal of 1025871012423 is 3242101785201.
1025871012423 is a `hidden beast` number, since 10 + 2 + 587 + 10 + 12 + 42 + 3 = 666.
It is not a de Polignac number, because 1025871012423 - 26 = 1025871012359 is a prime.
It is a super-2 number, since 2×10258710124232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1025871012427) 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 47 ways as a sum of consecutive naturals, for example, 111733893 + ... + 111743073.
Almost surely, 21025871012423 is an apocalyptic number.
1025871012423 is a deficient number, since it is larger than the sum of its proper divisors (502512259993).
1025871012423 is a wasteful number, since it uses less digits than its factorization.
1025871012423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10624 (or 10621 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
Adding to 1025871012423 its reverse (3242101785201), we get a palindrome (4267972797624).
The spelling of 1025871012423 in words is "one trillion, twenty-five billion, eight hundred seventy-one million, twelve thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •