Base | Representation |
---|---|
bin | 1010000010000011000111… |
… | …1000110110010101011101 |
3 | 1110001111011110220202011112 |
4 | 2200200301320312111131 |
5 | 2421210040112033313 |
6 | 35243131132231405 |
7 | 2215625303354402 |
oct | 240406170662535 |
9 | 43044143822145 |
10 | 11030313002333 |
11 | 3572a25148259 |
12 | 12a18b960b565 |
13 | 6202005ba221 |
14 | 2a1c273ba2a9 |
15 | 141dcca0e8a8 |
hex | a0831e3655d |
11030313002333 has 8 divisors (see below), whose sum is σ = 11287476208800. Its totient is φ = 10773179082288.
The previous prime is 11030313002257. The next prime is 11030313002369. The reversal of 11030313002333 is 33320031303011.
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-11030313002333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11030313002299 and 11030313002308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11030313001333) 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, 6558638 + ... + 8066991.
It is an arithmetic number, because the mean of its divisors is an integer number (1410934526100).
Almost surely, 211030313002333 is an apocalyptic number.
It is an amenable number.
11030313002333 is a deficient number, since it is larger than the sum of its proper divisors (257163206467).
11030313002333 is a wasteful number, since it uses less digits than its factorization.
11030313002333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14643211.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 11030313002333 its reverse (33320031303011), we get a palindrome (44350344305344).
The spelling of 11030313002333 in words is "eleven trillion, thirty billion, three hundred thirteen million, two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •