Base | Representation |
---|---|
bin | 10000001100110001010… |
… | …001100000100100111101 |
3 | 10221102102102212002022221 |
4 | 100030301101200210331 |
5 | 121214340120000013 |
6 | 2211224020405341 |
7 | 143266465046116 |
oct | 20146121404475 |
9 | 3842372762287 |
10 | 1113223203133 |
11 | 39a12a527248 |
12 | 15b900246851 |
13 | 80c90499622 |
14 | 3bc4773520d |
15 | 1de567e208d |
hex | 1033146093d |
1113223203133 has 8 divisors (see below), whose sum is σ = 1117277307360. Its totient is φ = 1109169353040.
The previous prime is 1113223203109. The next prime is 1113223203137. The reversal of 1113223203133 is 3313023223111.
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-1113223203133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1113223203098 and 1113223203107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113223203137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17455458 + ... + 17519116.
It is an arithmetic number, because the mean of its divisors is an integer number (139659663420).
Almost surely, 21113223203133 is an apocalyptic number.
It is an amenable number.
1113223203133 is a deficient number, since it is larger than the sum of its proper divisors (4054104227).
1113223203133 is an equidigital number, since it uses as much as digits as its factorization.
1113223203133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127067.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1113223203133 its reverse (3313023223111), we get a palindrome (4426246426244).
The spelling of 1113223203133 in words is "one trillion, one hundred thirteen billion, two hundred twenty-three million, two hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •