Base | Representation |
---|---|
bin | 11011110010011001110111… |
… | …111001111010010001110001 |
3 | 121000201020222111020220200212 |
4 | 123302121313321322101301 |
5 | 112004301122321010001 |
6 | 1111530544034153505 |
7 | 34512311532423602 |
oct | 3362316771722161 |
9 | 530636874226625 |
10 | 122211011110001 |
11 | 35a38442812100 |
12 | 11859390422895 |
13 | 53265ab2c76c8 |
14 | 222708a163da9 |
15 | e1dec75dd7bb |
hex | 6f2677e7a471 |
122211011110001 has 24 divisors (see below), whose sum is σ = 136630937963520. Its totient is φ = 109214858602080.
The previous prime is 122211011109959. The next prime is 122211011110031. The reversal of 122211011110001 is 100011110112221.
It is a de Polignac number, because none of the positive numbers 2k-122211011110001 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (122211011110031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34805831 + ... + 38155836.
It is an arithmetic number, because the mean of its divisors is an integer number (5692955748480).
Almost surely, 2122211011110001 is an apocalyptic number.
122211011110001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122211011110001 is a deficient number, since it is larger than the sum of its proper divisors (14419926853519).
122211011110001 is a wasteful number, since it uses less digits than its factorization.
122211011110001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72961925 (or 72961914 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 122211011110001 its reverse (100011110112221), we get a palindrome (222222121222222).
The spelling of 122211011110001 in words is "one hundred twenty-two trillion, two hundred eleven billion, eleven million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •