Base | Representation |
---|---|
bin | 1010010011101011001010… |
… | …0110101011110000111011 |
3 | 1111010102202122002210200001 |
4 | 2210322302212223300323 |
5 | 2441140212233241102 |
6 | 40034210305453431 |
7 | 2246535166233625 |
oct | 244726246536073 |
9 | 44112678083601 |
10 | 11333120212027 |
11 | 367a3929a6769 |
12 | 1330527041277 |
13 | 642929b9b853 |
14 | 2b275129bc15 |
15 | 149c0187e487 |
hex | a4eb29abc3b |
11333120212027 has 16 divisors (see below), whose sum is σ = 12091243114944. Its totient is φ = 10606353408000.
The previous prime is 11333120212003. The next prime is 11333120212033. The reversal of 11333120212027 is 72021202133311.
It is a cyclic number.
It is not a de Polignac number, because 11333120212027 - 27 = 11333120211899 is a prime.
It is a super-2 number, since 2×113331202120272 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11333120211986 and 11333120212004.
It is not an unprimeable number, because it can be changed into a prime (11333120212727) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52503174 + ... + 52718587.
It is an arithmetic number, because the mean of its divisors is an integer number (755702694684).
Almost surely, 211333120212027 is an apocalyptic number.
11333120212027 is a deficient number, since it is larger than the sum of its proper divisors (758122902917).
11333120212027 is a wasteful number, since it uses less digits than its factorization.
11333120212027 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105221910.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 11333120212027 its reverse (72021202133311), we get a palindrome (83354322345338).
The spelling of 11333120212027 in words is "eleven trillion, three hundred thirty-three billion, one hundred twenty million, two hundred twelve thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •