Base | Representation |
---|---|
bin | 1010010010010101000100… |
… | …1000010101100000110101 |
3 | 1111001020010001012220221022 |
4 | 2210211101020111200311 |
5 | 2440300400031431013 |
6 | 40015425154230525 |
7 | 2245056410024213 |
oct | 244452110254065 |
9 | 44036101186838 |
10 | 11310010030133 |
11 | 36706038a0a91 |
12 | 1327b57585445 |
13 | 6406b60425c9 |
14 | 2b159bccbcb3 |
15 | 1492eca58008 |
hex | a4951215835 |
11310010030133 has 8 divisors (see below), whose sum is σ = 11481697846368. Its totient is φ = 11139544191664.
The previous prime is 11310010030103. The next prime is 11310010030159. The reversal of 11310010030133 is 33103001001311.
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 11310010030133 - 214 = 11310010013749 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 (11310010030103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 305475791 + ... + 305512812.
It is an arithmetic number, because the mean of its divisors is an integer number (1435212230796).
Almost surely, 211310010030133 is an apocalyptic number.
It is an amenable number.
11310010030133 is a deficient number, since it is larger than the sum of its proper divisors (171687816235).
11310010030133 is a wasteful number, since it uses less digits than its factorization.
11310010030133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610988883.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 11310010030133 its reverse (33103001001311), we get a palindrome (44413011031444).
The spelling of 11310010030133 in words is "eleven trillion, three hundred ten billion, ten million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •