Base | Representation |
---|---|
bin | 10000011101010110101… |
… | …101101010110011010111 |
3 | 11000010101111202121222010 |
4 | 100131112231222303113 |
5 | 122012322442224343 |
6 | 2223331044035303 |
7 | 144500002446054 |
oct | 20352655526327 |
9 | 4003344677863 |
10 | 1131031211223 |
11 | 3a67386a6301 |
12 | 163250092b33 |
13 | 8286a9b7914 |
14 | 3ca5686602b |
15 | 1e649dc3d33 |
hex | 10756b6acd7 |
1131031211223 has 48 divisors (see below), whose sum is σ = 1648281487104. Its totient is φ = 689302748160.
The previous prime is 1131031211213. The next prime is 1131031211269. The reversal of 1131031211223 is 3221121301311.
It is not a de Polignac number, because 1131031211223 - 29 = 1131031210711 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1131031211223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131031211203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7999086 + ... + 8139252.
It is an arithmetic number, because the mean of its divisors is an integer number (34339197648).
Almost surely, 21131031211223 is an apocalyptic number.
1131031211223 is a deficient number, since it is larger than the sum of its proper divisors (517250275881).
1131031211223 is a wasteful number, since it uses less digits than its factorization.
1131031211223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140472 (or 140455 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1131031211223 its reverse (3221121301311), we get a palindrome (4352152512534).
The spelling of 1131031211223 in words is "one trillion, one hundred thirty-one billion, thirty-one million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •