Base | Representation |
---|---|
bin | 10000011111010011110… |
… | …100011010001110011101 |
3 | 11000022210210020202200221 |
4 | 100133103310122032131 |
5 | 122031122303132313 |
6 | 2224315223121341 |
7 | 144603010121545 |
oct | 20372364321635 |
9 | 4008723222627 |
10 | 1133130130333 |
11 | 3a76154662a3 |
12 | 163736ba3251 |
13 | 82b137b77a6 |
14 | 3cbb5510325 |
15 | 1e71e2c5c8d |
hex | 107d3d1a39d |
1133130130333 has 8 divisors (see below), whose sum is σ = 1207145490048. Its totient is φ = 1059932620224.
The previous prime is 1133130130289. The next prime is 1133130130339. The reversal of 1133130130333 is 3330310313311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1133130130333 - 221 = 1133128033181 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1133130130298 and 1133130130307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133130130339) 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, 204459541 + ... + 204465082.
It is an arithmetic number, because the mean of its divisors is an integer number (150893186256).
Almost surely, 21133130130333 is an apocalyptic number.
It is an amenable number.
1133130130333 is a deficient number, since it is larger than the sum of its proper divisors (74015359715).
1133130130333 is a wasteful number, since it uses less digits than its factorization.
1133130130333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 408924803.
The product of its (nonzero) digits is 2187, while the sum is 25.
Adding to 1133130130333 its reverse (3330310313311), we get a palindrome (4463440443644).
The spelling of 1133130130333 in words is "one trillion, one hundred thirty-three billion, one hundred thirty million, one hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •