Base | Representation |
---|---|
bin | 10000011111001100110… |
… | …110011100001110011101 |
3 | 11000022111122021020000211 |
4 | 100133030312130032131 |
5 | 122030402341103201 |
6 | 2224255445252421 |
7 | 144600060326032 |
oct | 20371466341635 |
9 | 4008448236024 |
10 | 1133013222301 |
11 | 3a7565476594 |
12 | 163703a04111 |
13 | 82ac550403c |
14 | 3cba3b9b389 |
15 | 1e713dd1651 |
hex | 107ccd9c39d |
1133013222301 has 4 divisors (see below), whose sum is σ = 1135536637500. Its totient is φ = 1130489807104.
The previous prime is 1133013222287. The next prime is 1133013222347. The reversal of 1133013222301 is 1032223103311.
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 811393799076 + 321619423225 = 900774^2 + 567115^2 .
It is a cyclic number.
It is not a de Polignac number, because 1133013222301 - 25 = 1133013222269 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 (1133013222391) 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, 1261706926 + ... + 1261707823.
It is an arithmetic number, because the mean of its divisors is an integer number (283884159375).
Almost surely, 21133013222301 is an apocalyptic number.
It is an amenable number.
1133013222301 is a deficient number, since it is larger than the sum of its proper divisors (2523415199).
1133013222301 is an equidigital number, since it uses as much as digits as its factorization.
1133013222301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2523415198.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1133013222301 its reverse (1032223103311), we get a palindrome (2165236325612).
The spelling of 1133013222301 in words is "one trillion, one hundred thirty-three billion, thirteen million, two hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •