Base | Representation |
---|---|
bin | 10001101000001110010… |
… | …100111000100101001011 |
3 | 11021210220000120210021020 |
4 | 101220032110320211023 |
5 | 124321442302230011 |
6 | 2324304051043523 |
7 | 153344100506166 |
oct | 21501624704513 |
9 | 4253800523236 |
10 | 1211421133131 |
11 | 4278407144a0 |
12 | 1769465a05a3 |
13 | 8a30c842a51 |
14 | 428c1300add |
15 | 217a2715006 |
hex | 11a0e53894b |
1211421133131 has 16 divisors (see below), whose sum is σ = 1778535024768. Its totient is φ = 727332992000.
The previous prime is 1211421133121. The next prime is 1211421133163. The reversal of 1211421133131 is 1313311241121.
It is a cyclic number.
It is not a de Polignac number, because 1211421133131 - 223 = 1211412744523 is a prime.
It is a super-3 number, since 3×12114211331313 (a number of 37 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 (1211421133121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 171537270 + ... + 171544331.
It is an arithmetic number, because the mean of its divisors is an integer number (111158439048).
Almost surely, 21211421133131 is an apocalyptic number.
1211421133131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1211421133131 is a deficient number, since it is larger than the sum of its proper divisors (567113891637).
1211421133131 is a wasteful number, since it uses less digits than its factorization.
1211421133131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 343081722.
The product of its digits is 432, while the sum is 24.
Adding to 1211421133131 its reverse (1313311241121), we get a palindrome (2524732374252).
The spelling of 1211421133131 in words is "one trillion, two hundred eleven billion, four hundred twenty-one million, one hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •