Base | Representation |
---|---|
bin | 11110101001110010010… |
… | …00100001010000111101 |
3 | 10201200120002122002210110 |
4 | 33110321020201100331 |
5 | 114224001213202422 |
6 | 2123502314100233 |
7 | 136043624140500 |
oct | 17247110412075 |
9 | 3650502562713 |
10 | 1053225522237 |
11 | 3767413935a9 |
12 | 15015711a679 |
13 | 7841b371bb5 |
14 | 38d952c7137 |
15 | 1c5e439b60c |
hex | f53922143d |
1053225522237 has 48 divisors (see below), whose sum is σ = 1720009382400. Its totient is φ = 570015502560.
The previous prime is 1053225522229. The next prime is 1053225522241. The reversal of 1053225522237 is 7322255223501.
It is not a de Polignac number, because 1053225522237 - 23 = 1053225522229 is a prime.
It is a super-2 number, since 2×10532255222372 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1053225522195 and 1053225522204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053225522247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10875214 + ... + 10971632.
It is an arithmetic number, because the mean of its divisors is an integer number (35833528800).
Almost surely, 21053225522237 is an apocalyptic number.
It is an amenable number.
1053225522237 is a deficient number, since it is larger than the sum of its proper divisors (666783860163).
1053225522237 is a wasteful number, since it uses less digits than its factorization.
1053225522237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100366 (or 100359 counting only the distinct ones).
The product of its (nonzero) digits is 252000, while the sum is 39.
The spelling of 1053225522237 in words is "one trillion, fifty-three billion, two hundred twenty-five million, five hundred twenty-two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •