Base | Representation |
---|---|
bin | 11110101001101000010… |
… | …11000110110011110001 |
3 | 10201200100022001200212020 |
4 | 33110310023012303301 |
5 | 114223313413023400 |
6 | 2123450142422053 |
7 | 136041563653521 |
oct | 17246413066361 |
9 | 3650308050766 |
10 | 1053142314225 |
11 | 3766a9421151 |
12 | 150133291929 |
13 | 7840705a5a1 |
14 | 38d88227681 |
15 | 1c5dbe122a0 |
hex | f5342c6cf1 |
1053142314225 has 24 divisors (see below), whose sum is σ = 1742797263360. Its totient is φ = 561159136320.
The previous prime is 1053142314223. The next prime is 1053142314229. The reversal of 1053142314225 is 5224132413501.
It is not a de Polignac number, because 1053142314225 - 21 = 1053142314223 is a prime.
It is a super-2 number, since 2×10531423142252 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1053142314221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6377490 + ... + 6540539.
It is an arithmetic number, because the mean of its divisors is an integer number (72616552640).
Almost surely, 21053142314225 is an apocalyptic number.
1053142314225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1053142314225 is a deficient number, since it is larger than the sum of its proper divisors (689654949135).
1053142314225 is a wasteful number, since it uses less digits than its factorization.
1053142314225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12919129 (or 12919124 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 1053142314225 its reverse (5224132413501), we get a palindrome (6277274727726).
The spelling of 1053142314225 in words is "one trillion, fifty-three billion, one hundred forty-two million, three hundred fourteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •