Base | Representation |
---|---|
bin | 1011000111011011001111… |
… | …1101001100100101001101 |
3 | 1121021102122012200121001100 |
4 | 2301312303331030211031 |
5 | 3100222031441333401 |
6 | 41554445055133313 |
7 | 2401011352252056 |
oct | 261666375144515 |
9 | 47242565617040 |
10 | 12222201121101 |
11 | 399245199a974 |
12 | 14548b2514239 |
13 | 6a871941b3ba |
14 | 3037b443572d |
15 | 162dda49eb86 |
hex | b1db3f4c94d |
12222201121101 has 12 divisors (see below), whose sum is σ = 17660080738300. Its totient is φ = 8145461666880.
The previous prime is 12222201121087. The next prime is 12222201121103. The reversal of 12222201121101 is 10112110222221.
12222201121101 is a `hidden beast` number, since 1 + 222 + 220 + 1 + 121 + 101 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1422893508201 + 10799307612900 = 1192851^2 + 3286230^2 .
It is not a de Polignac number, because 12222201121101 - 223 = 12222192732493 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12222201121103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 222672190 + ... + 222727071.
Almost surely, 212222201121101 is an apocalyptic number.
It is an amenable number.
12222201121101 is a deficient number, since it is larger than the sum of its proper divisors (5437879617199).
12222201121101 is a wasteful number, since it uses less digits than its factorization.
12222201121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445402316 (or 445402313 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 12222201121101 its reverse (10112110222221), we get a palindrome (22334311343322).
The spelling of 12222201121101 in words is "twelve trillion, two hundred twenty-two billion, two hundred one million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •