Base | Representation |
---|---|
bin | 10000011111010011111… |
… | …000100100101111111101 |
3 | 11000022210212022020012112 |
4 | 100133103320210233331 |
5 | 122031123043101023 |
6 | 2224315302343405 |
7 | 144603022316360 |
oct | 20372370445775 |
9 | 4008725266175 |
10 | 1133131222013 |
11 | 3a761604150a |
12 | 16373742ab65 |
13 | 82b13aaa65b |
14 | 3cbb57160d7 |
15 | 1e71e43e478 |
hex | 107d3e24bfd |
1133131222013 has 8 divisors (see below), whose sum is σ = 1295014588800. Its totient is φ = 971249724720.
The previous prime is 1133131221997. The next prime is 1133131222021. The reversal of 1133131222013 is 3102221313311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1133131222013 - 24 = 1133131221997 is a prime.
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 1133131222013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133131222063) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1254248 + ... + 1959438.
It is an arithmetic number, because the mean of its divisors is an integer number (161876823600).
Almost surely, 21133131222013 is an apocalyptic number.
It is an amenable number.
1133131222013 is a deficient number, since it is larger than the sum of its proper divisors (161883366787).
1133131222013 is an equidigital number, since it uses as much as digits as its factorization.
1133131222013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 934747.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1133131222013 its reverse (3102221313311), we get a palindrome (4235352535324).
The spelling of 1133131222013 in words is "one trillion, one hundred thirty-three billion, one hundred thirty-one million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •