Base | Representation |
---|---|
bin | 10000011101100001111… |
… | …110101110000010101001 |
3 | 11000010212200102210102011 |
4 | 100131201332232002221 |
5 | 122013214334332223 |
6 | 2223401515235521 |
7 | 144504456210115 |
oct | 20354176560251 |
9 | 4003780383364 |
10 | 1131220230313 |
11 | 3a6825369128 |
12 | 1632a3448ba1 |
13 | 8289abc8a34 |
14 | 3ca739ca745 |
15 | 1e65b7ae80d |
hex | 10761fae0a9 |
1131220230313 has 8 divisors (see below), whose sum is σ = 1199976585480. Its totient is φ = 1062709873920.
The previous prime is 1131220230253. The next prime is 1131220230317. The reversal of 1131220230313 is 3130320221311.
It can be written as a sum of positive squares in 4 ways, for example, as 509499019264 + 621721211049 = 713792^2 + 788493^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1131220230313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1131220230317) 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, 61490218 + ... + 61508611.
It is an arithmetic number, because the mean of its divisors is an integer number (149997073185).
Almost surely, 21131220230313 is an apocalyptic number.
It is an amenable number.
1131220230313 is a deficient number, since it is larger than the sum of its proper divisors (68756355167).
1131220230313 is a wasteful number, since it uses less digits than its factorization.
1131220230313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122999387.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1131220230313 its reverse (3130320221311), we get a palindrome (4261540451624).
The spelling of 1131220230313 in words is "one trillion, one hundred thirty-one billion, two hundred twenty million, two hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •