Base | Representation |
---|---|
bin | 10000011100101101000… |
… | …110001101101001001001 |
3 | 11000001120211221221101212 |
4 | 100130231012031221021 |
5 | 122004410222033223 |
6 | 2223133503022505 |
7 | 144443463664424 |
oct | 20345506155111 |
9 | 4001524857355 |
10 | 1130333002313 |
11 | 3a640a56a649 |
12 | 16309629aa35 |
13 | 82789154858 |
14 | 3c9cbc369bb |
15 | 1e608957278 |
hex | 1072d18da49 |
1130333002313 has 4 divisors (see below), whose sum is σ = 1130713460688. Its totient is φ = 1129952543940.
The previous prime is 1130333002231. The next prime is 1130333002327. The reversal of 1130333002313 is 3132003330311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1130333002313 - 212 = 1130332998217 is a prime.
It is a super-2 number, since 2×11303330023132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1130333002373) 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, 190224731 + ... + 190230672.
It is an arithmetic number, because the mean of its divisors is an integer number (282678365172).
Almost surely, 21130333002313 is an apocalyptic number.
It is an amenable number.
1130333002313 is a deficient number, since it is larger than the sum of its proper divisors (380458375).
1130333002313 is an equidigital number, since it uses as much as digits as its factorization.
1130333002313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 380458374.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 1130333002313 its reverse (3132003330311), we get a palindrome (4262336332624).
The spelling of 1130333002313 in words is "one trillion, one hundred thirty billion, three hundred thirty-three million, two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •