Base | Representation |
---|---|
bin | 110011001100011010001011… |
… | …110100111011101111101110 |
3 | 1002112012102120011022211201021 |
4 | 303030122023310323233232 |
5 | 214002402043101001032 |
6 | 2114505525513204354 |
7 | 65265530146355413 |
oct | 6314321364735756 |
9 | 1075172504284637 |
10 | 225153121500142 |
11 | 658169a23a2280 |
12 | 21304224a006ba |
13 | 9882b047cb514 |
14 | 3d8567d7ac10a |
15 | 1b06b392ba097 |
hex | ccc68bd3bbee |
225153121500142 has 16 divisors (see below), whose sum is σ = 368432824298112. Its totient is φ = 102342204715320.
The previous prime is 225153121500089. The next prime is 225153121500169. The reversal of 225153121500142 is 241005121351522.
It is a junction number, because it is equal to n+sod(n) for n = 225153121500098 and 225153121500107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13986943 + ... + 25415365.
It is an arithmetic number, because the mean of its divisors is an integer number (23027051518632).
Almost surely, 2225153121500142 is an apocalyptic number.
225153121500142 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
225153121500142 is a deficient number, since it is larger than the sum of its proper divisors (143279702797970).
225153121500142 is a wasteful number, since it uses less digits than its factorization.
225153121500142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12323943.
The product of its (nonzero) digits is 24000, while the sum is 34.
Adding to 225153121500142 its reverse (241005121351522), we get a palindrome (466158242851664).
The spelling of 225153121500142 in words is "two hundred twenty-five trillion, one hundred fifty-three billion, one hundred twenty-one million, five hundred thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •