Base | Representation |
---|---|
bin | 11101110101101011101… |
… | …10101100011000111110 |
3 | 10122000100122211102202010 |
4 | 32322311312230120332 |
5 | 113244204311331032 |
6 | 2102554514512050 |
7 | 134033505444501 |
oct | 16726566543076 |
9 | 3560318742663 |
10 | 1025253230142 |
11 | 3658977a1529 |
12 | 14684b295626 |
13 | 758b1105a7b |
14 | 378a02ab138 |
15 | 1ba087a9ccc |
hex | eeb5dac63e |
1025253230142 has 8 divisors (see below), whose sum is σ = 2050506460296. Its totient is φ = 341751076712.
The previous prime is 1025253230119. The next prime is 1025253230143. The reversal of 1025253230142 is 2410323525201.
It is a sphenic number, since it is the product of 3 distinct primes.
1025253230142 is an admirable number.
It is a super-2 number, since 2×10252532301422 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1025253230143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85437769173 + ... + 85437769184.
It is an arithmetic number, because the mean of its divisors is an integer number (256313307537).
Almost surely, 21025253230142 is an apocalyptic number.
1025253230142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025253230142 is a wasteful number, since it uses less digits than its factorization.
1025253230142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170875538362.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 1025253230142 its reverse (2410323525201), we get a palindrome (3435576755343).
The spelling of 1025253230142 in words is "one trillion, twenty-five billion, two hundred fifty-three million, two hundred thirty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •