Base | Representation |
---|---|
bin | 1010010011101011011101… |
… | …0111000110001110111110 |
3 | 1111010102222012021001221211 |
4 | 2210322313113012032332 |
5 | 2441140343200342342 |
6 | 40034222240115034 |
7 | 2246540155435354 |
oct | 244726727061676 |
9 | 44112865231854 |
10 | 11333200012222 |
11 | 367a423a50840 |
12 | 1330549905a7a |
13 | 64294058bcba |
14 | 2b275bb117d4 |
15 | 149c08893c17 |
hex | a4eb75c63be |
11333200012222 has 8 divisors (see below), whose sum is σ = 18545236383672. Its totient is φ = 5151454551000.
The previous prime is 11333200012219. The next prime is 11333200012231. The reversal of 11333200012222 is 22221000233311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 515145455101 = 11333200012222 / (1 + 1 + 3 + 3 + 3 + 2 + 0 + 0 + 0 + 1 + 2 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 11333200012193 and 11333200012202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 257572727529 + ... + 257572727572.
It is an arithmetic number, because the mean of its divisors is an integer number (2318154547959).
Almost surely, 211333200012222 is an apocalyptic number.
11333200012222 is a deficient number, since it is larger than the sum of its proper divisors (7212036371450).
11333200012222 is a wasteful number, since it uses less digits than its factorization.
11333200012222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 515145455114.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 11333200012222 its reverse (22221000233311), we get a palindrome (33554200245533).
The spelling of 11333200012222 in words is "eleven trillion, three hundred thirty-three billion, two hundred million, twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •