Base | Representation |
---|---|
bin | 10000011100100101001… |
… | …100000010011000000101 |
3 | 11000001020121021112112221 |
4 | 100130211030002120011 |
5 | 122004122234430201 |
6 | 2223112403012341 |
7 | 144440263065235 |
oct | 20344514023005 |
9 | 4001217245487 |
10 | 1130200311301 |
11 | 3a635167a956 |
12 | 16305996a0b1 |
13 | 82767806269 |
14 | 3c9b8375cc5 |
15 | 1e5ebe964a1 |
hex | 10725302605 |
1130200311301 has 4 divisors (see below), whose sum is σ = 1196682682572. Its totient is φ = 1063717940032.
The previous prime is 1130200311299. The next prime is 1130200311337. The reversal of 1130200311301 is 1031130020311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 738826202500 + 391374108801 = 859550^2 + 625599^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130200311301 - 21 = 1130200311299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130200311001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33241185610 + ... + 33241185643.
It is an arithmetic number, because the mean of its divisors is an integer number (299170670643).
Almost surely, 21130200311301 is an apocalyptic number.
It is an amenable number.
1130200311301 is a deficient number, since it is larger than the sum of its proper divisors (66482371271).
1130200311301 is an equidigital number, since it uses as much as digits as its factorization.
1130200311301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66482371270.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1130200311301 its reverse (1031130020311), we get a palindrome (2161330331612).
The spelling of 1130200311301 in words is "one trillion, one hundred thirty billion, two hundred million, three hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •