Base | Representation |
---|---|
bin | 10000011100100111001… |
… | …001001001111100011101 |
3 | 11000001022212222220022201 |
4 | 100130213021021330131 |
5 | 122004204134012201 |
6 | 2223115534011501 |
7 | 144441141632161 |
oct | 20344711117435 |
9 | 4001285886281 |
10 | 1130233110301 |
11 | 3a6369142269 |
12 | 163068946b91 |
13 | 8277154b259 |
14 | 3c9bc872ca1 |
15 | 1e5eecc4801 |
hex | 10727249f1d |
1130233110301 has 4 divisors (see below), whose sum is σ = 1130235730492. Its totient is φ = 1130230490112.
The previous prime is 1130233110289. The next prime is 1130233110311. The reversal of 1130233110301 is 1030113320311.
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 774690427225 + 355542683076 = 880165^2 + 596274^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130233110301 - 217 = 1130232979229 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 (1130233110311) 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, 493326 + ... + 1582351.
It is an arithmetic number, because the mean of its divisors is an integer number (282558932623).
Almost surely, 21130233110301 is an apocalyptic number.
It is an amenable number.
1130233110301 is a deficient number, since it is larger than the sum of its proper divisors (2620191).
1130233110301 is an equidigital number, since it uses as much as digits as its factorization.
1130233110301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2620190.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1130233110301 its reverse (1030113320311), we get a palindrome (2160346430612).
The spelling of 1130233110301 in words is "one trillion, one hundred thirty billion, two hundred thirty-three million, one hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •