Base | Representation |
---|---|
bin | 10001101000001110010… |
… | …100111000100101001100 |
3 | 11021210220000120210021021 |
4 | 101220032110320211030 |
5 | 124321442302230012 |
6 | 2324304051043524 |
7 | 153344100506200 |
oct | 21501624704514 |
9 | 4253800523237 |
10 | 1211421133132 |
11 | 4278407144a1 |
12 | 1769465a05a4 |
13 | 8a30c842a52 |
14 | 428c1300b00 |
15 | 217a2715007 |
hex | 11a0e53894c |
1211421133132 has 36 divisors (see below), whose sum is σ = 2472257360664. Its totient is φ = 517885737600.
The previous prime is 1211421133121. The next prime is 1211421133163. The reversal of 1211421133132 is 2313311241121.
It is a super-3 number, since 3×12114211331323 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1211421133097 and 1211421133106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7628038 + ... + 7785229.
It is an arithmetic number, because the mean of its divisors is an integer number (68673815574).
Almost surely, 21211421133132 is an apocalyptic number.
It is an amenable number.
1211421133132 is an abundant number, since it is smaller than the sum of its proper divisors (1260836227532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211421133132 is a wasteful number, since it uses less digits than its factorization.
1211421133132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15413686 (or 15413677 counting only the distinct ones).
The product of its digits is 864, while the sum is 25.
Adding to 1211421133132 its reverse (2313311241121), we get a palindrome (3524732374253).
The spelling of 1211421133132 in words is "one trillion, two hundred eleven billion, four hundred twenty-one million, one hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •