Base | Representation |
---|---|
bin | 10000011111011000110… |
… | …001010111110111001101 |
3 | 11000100000120121011201011 |
4 | 100133120301113313031 |
5 | 122031310041022201 |
6 | 2224331352045221 |
7 | 144605036304421 |
oct | 20373061276715 |
9 | 4010016534634 |
10 | 1133213220301 |
11 | 3a7658357a98 |
12 | 16375a993811 |
13 | 82b27a8a456 |
14 | 3cbc257cb81 |
15 | 1e72673a151 |
hex | 107d8c57dcd |
1133213220301 has 8 divisors (see below), whose sum is σ = 1176231300608. Its totient is φ = 1090599066000.
The previous prime is 1133213220277. The next prime is 1133213220319. The reversal of 1133213220301 is 1030223123311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1133213220301 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 (1133213220101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100975785 + ... + 100987006.
It is an arithmetic number, because the mean of its divisors is an integer number (147028912576).
Almost surely, 21133213220301 is an apocalyptic number.
It is an amenable number.
1133213220301 is a deficient number, since it is larger than the sum of its proper divisors (43018080307).
1133213220301 is a wasteful number, since it uses less digits than its factorization.
1133213220301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201963003.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1133213220301 its reverse (1030223123311), we get a palindrome (2163436343612).
The spelling of 1133213220301 in words is "one trillion, one hundred thirty-three billion, two hundred thirteen million, two hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •