Base | Representation |
---|---|
bin | 1010000000010010101001… |
… | …0111010111001010101101 |
3 | 1102221121020102020112202201 |
4 | 2200010222113113022231 |
5 | 2420211222213343313 |
6 | 35221215234421501 |
7 | 2213506164235366 |
oct | 240045227271255 |
9 | 42847212215681 |
10 | 11000122012333 |
11 | 3561142115653 |
12 | 1297a92731891 |
13 | 61a3cb7a3bbc |
14 | 2a05a1856b6d |
15 | 14121225b0dd |
hex | a012a5d72ad |
11000122012333 has 8 divisors (see below), whose sum is σ = 11053573784928. Its totient is φ = 10946714039184.
The previous prime is 11000122012309. The next prime is 11000122012351. The reversal of 11000122012333 is 33321022100011.
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-11000122012333 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11000122012333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000122012303) 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, 10446291 + ... + 11450992.
It is an arithmetic number, because the mean of its divisors is an integer number (1381696723116).
Almost surely, 211000122012333 is an apocalyptic number.
It is an amenable number.
11000122012333 is a deficient number, since it is larger than the sum of its proper divisors (53451772595).
11000122012333 is a wasteful number, since it uses less digits than its factorization.
11000122012333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21899723.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11000122012333 its reverse (33321022100011), we get a palindrome (44321144112344).
The spelling of 11000122012333 in words is "eleven trillion, one hundred twenty-two million, twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •