Base | Representation |
---|---|
bin | 1010001100101000010101… |
… | …0110110110001000111011 |
3 | 1110200212101122222201111220 |
4 | 2203022011112312020323 |
5 | 2432144341103014321 |
6 | 35502434001323123 |
7 | 2235022224352566 |
oct | 243120526661073 |
9 | 43625348881456 |
10 | 11212102001211 |
11 | 363303130a801 |
12 | 1310b923364a3 |
13 | 6343b1a6c397 |
14 | 2aa950a274dd |
15 | 1469bc2eb9c6 |
hex | a32855b623b |
11212102001211 has 8 divisors (see below), whose sum is σ = 14950566437184. Its totient is φ = 7474186116360.
The previous prime is 11212102001189. The next prime is 11212102001257. The reversal of 11212102001211 is 11210020121211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11212102001211 - 217 = 11212101870139 is a prime.
It is a super-3 number, since 3×112121020012113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (11212102001281) 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, 137090085 + ... + 137171846.
It is an arithmetic number, because the mean of its divisors is an integer number (1868820804648).
Almost surely, 211212102001211 is an apocalyptic number.
11212102001211 is a deficient number, since it is larger than the sum of its proper divisors (3738464435973).
11212102001211 is a wasteful number, since it uses less digits than its factorization.
11212102001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274275561.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11212102001211 its reverse (11210020121211), we get a palindrome (22422122122422).
The spelling of 11212102001211 in words is "eleven trillion, two hundred twelve billion, one hundred two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •