Base | Representation |
---|---|
bin | 10001101000001101001… |
… | …100011100001000001100 |
3 | 11021210211200211221122011 |
4 | 101220031030130020030 |
5 | 124321422422022340 |
6 | 2324302132031004 |
7 | 153343450212124 |
oct | 21501514341014 |
9 | 4253750757564 |
10 | 1211402142220 |
11 | 427830a23326 |
12 | 176940162464 |
13 | 8a308923a1a |
14 | 428bc999c84 |
15 | 217a0c130ea |
hex | 11a0d31c20c |
1211402142220 has 48 divisors (see below), whose sum is σ = 2566798728480. Its totient is φ = 480208813056.
The previous prime is 1211402142199. The next prime is 1211402142271. The reversal of 1211402142220 is 222412041121.
It is a super-3 number, since 3×12114021422203 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1211402142191 and 1211402142200.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19266754 + ... + 19329526.
It is an arithmetic number, because the mean of its divisors is an integer number (53474973510).
Almost surely, 21211402142220 is an apocalyptic number.
1211402142220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1211402142220 is an abundant number, since it is smaller than the sum of its proper divisors (1355396586260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211402142220 is a wasteful number, since it uses less digits than its factorization.
1211402142220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71434 (or 71432 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 1211402142220 its reverse (222412041121), we get a palindrome (1433814183341).
The spelling of 1211402142220 in words is "one trillion, two hundred eleven billion, four hundred two million, one hundred forty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •