Base | Representation |
---|---|
bin | 10000010111111100100… |
… | …110111010101000111111 |
3 | 10222120101211110101001101 |
4 | 100113330212322220333 |
5 | 121413424434234401 |
6 | 2220530534353531 |
7 | 144203053434604 |
oct | 20277446725077 |
9 | 3876354411041 |
10 | 1125224524351 |
11 | 3a4228a00534 |
12 | 1620ab4bb8a7 |
13 | 821539a4625 |
14 | 3c6655b86ab |
15 | 1e40a224101 |
hex | 105fc9baa3f |
1125224524351 has 16 divisors (see below), whose sum is σ = 1193810400000. Its totient is φ = 1056906118528.
The previous prime is 1125224524349. The next prime is 1125224524373. The reversal of 1125224524351 is 1534254225211.
It is a cyclic number.
It is not a de Polignac number, because 1125224524351 - 21 = 1125224524349 is a prime.
It is a super-2 number, since 2×11252245243512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1125224524351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1125224524321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32598900 + ... + 32633398.
It is an arithmetic number, because the mean of its divisors is an integer number (74613150000).
Almost surely, 21125224524351 is an apocalyptic number.
1125224524351 is a deficient number, since it is larger than the sum of its proper divisors (68585875649).
1125224524351 is a wasteful number, since it uses less digits than its factorization.
1125224524351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38318.
The product of its digits is 96000, while the sum is 37.
Adding to 1125224524351 its reverse (1534254225211), we get a palindrome (2659478749562).
The spelling of 1125224524351 in words is "one trillion, one hundred twenty-five billion, two hundred twenty-four million, five hundred twenty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •