Base | Representation |
---|---|
bin | 10000001100110111001… |
… | …011010001110111010101 |
3 | 10221102200100012100011221 |
4 | 100030313023101313111 |
5 | 121220040442431201 |
6 | 2211241515130341 |
7 | 143302106561605 |
oct | 20146713216725 |
9 | 3842610170157 |
10 | 1113322233301 |
11 | 39a180416063 |
12 | 15b9294439b1 |
13 | 80ca7b60865 |
14 | 3bc56952c05 |
15 | 1de603544a1 |
hex | 103372d1dd5 |
1113322233301 has 4 divisors (see below), whose sum is σ = 1113324826572. Its totient is φ = 1113319640032.
The previous prime is 1113322233259. The next prime is 1113322233307. The reversal of 1113322233301 is 1033322233111.
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 913647310801 + 199674922500 = 955849^2 + 446850^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113322233301 - 27 = 1113322233173 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 (1113322233307) 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, 482110 + ... + 1568143.
It is an arithmetic number, because the mean of its divisors is an integer number (278331206643).
Almost surely, 21113322233301 is an apocalyptic number.
It is an amenable number.
1113322233301 is a deficient number, since it is larger than the sum of its proper divisors (2593271).
1113322233301 is an equidigital number, since it uses as much as digits as its factorization.
1113322233301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2593270.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1113322233301 its reverse (1033322233111), we get a palindrome (2146644466412).
The spelling of 1113322233301 in words is "one trillion, one hundred thirteen billion, three hundred twenty-two million, two hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •