Base | Representation |
---|---|
bin | 1010000000010011000011… |
… | …1111111001110000111110 |
3 | 1102221121112011122201000001 |
4 | 2200010300333321300332 |
5 | 2420211434211144402 |
6 | 35221234252024514 |
7 | 2213512015214311 |
oct | 240046077716076 |
9 | 42847464581001 |
10 | 11000233303102 |
11 | 3561199a18a9a |
12 | 1297b03a6213a |
13 | 61a41886b924 |
14 | 2a05b2546978 |
15 | 14121bde1187 |
hex | a0130ff9c3e |
11000233303102 has 8 divisors (see below), whose sum is σ = 16550199955512. Its totient is φ = 5483499984600.
The previous prime is 11000233303099. The next prime is 11000233303109. The reversal of 11000233303102 is 20130333200011.
11000233303102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11000233303102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000233303109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8308332649 + ... + 8308333972.
It is an arithmetic number, because the mean of its divisors is an integer number (2068774994439).
Almost surely, 211000233303102 is an apocalyptic number.
11000233303102 is a deficient number, since it is larger than the sum of its proper divisors (5549966652410).
11000233303102 is a wasteful number, since it uses less digits than its factorization.
11000233303102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16616666954.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 11000233303102 its reverse (20130333200011), we get a palindrome (31130566503113).
The spelling of 11000233303102 in words is "eleven trillion, two hundred thirty-three million, three hundred three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •