Base | Representation |
---|---|
bin | 1010000000111011111101… |
… | …1000010100001101001001 |
3 | 1102222122212022000101210020 |
4 | 2200032333120110031021 |
5 | 2420401430233031441 |
6 | 35230251515411053 |
7 | 2214351045502212 |
oct | 240167730241511 |
9 | 42878768011706 |
10 | 11011212002121 |
11 | 3565913128071 |
12 | 129a068753a89 |
13 | 61b478248936 |
14 | 2a0d34670409 |
15 | 141660b73e66 |
hex | a03bf614349 |
11011212002121 has 32 divisors (see below), whose sum is σ = 14923621440000. Its totient is φ = 7220364484608.
The previous prime is 11011212002099. The next prime is 11011212002123. The reversal of 11011212002121 is 12120021211011.
It is a happy number.
It is not a de Polignac number, because 11011212002121 - 26 = 11011212002057 is a prime.
It is a super-2 number, since 2×110112120021212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11011212002121.
It is not an unprimeable number, because it can be changed into a prime (11011212002123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 919971625 + ... + 919983593.
It is an arithmetic number, because the mean of its divisors is an integer number (466363170000).
Almost surely, 211011212002121 is an apocalyptic number.
It is an amenable number.
11011212002121 is a deficient number, since it is larger than the sum of its proper divisors (3912409437879).
11011212002121 is a wasteful number, since it uses less digits than its factorization.
11011212002121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23233.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11011212002121 its reverse (12120021211011), we get a palindrome (23131233213132).
The spelling of 11011212002121 in words is "eleven trillion, eleven billion, two hundred twelve million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •