Base | Representation |
---|---|
bin | 10001101001111001100… |
… | …111010101001100000011 |
3 | 11021222112110121011011101 |
4 | 101221321213111030003 |
5 | 124334134102143021 |
6 | 2325202431155231 |
7 | 153436515314341 |
oct | 21517147251403 |
9 | 4258473534141 |
10 | 1213221131011 |
11 | 42858477754a |
12 | 177169375b17 |
13 | 8a538731b56 |
14 | 42a123b6991 |
15 | 2185a76ca91 |
hex | 11a799d5303 |
1213221131011 has 8 divisors (see below), whose sum is σ = 1284607278720. Its totient is φ = 1141837227648.
The previous prime is 1213221131009. The next prime is 1213221131051. The reversal of 1213221131011 is 1101311223121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1213221131011 - 21 = 1213221131009 is a prime.
It is a super-2 number, since 2×12132211310112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1213221131011.
It is not an unprimeable number, because it can be changed into a prime (1213221131051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 623305 + ... + 1677781.
It is an arithmetic number, because the mean of its divisors is an integer number (160575909840).
Almost surely, 21213221131011 is an apocalyptic number.
1213221131011 is a deficient number, since it is larger than the sum of its proper divisors (71386147709).
1213221131011 is a wasteful number, since it uses less digits than its factorization.
1213221131011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1122173.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1213221131011 its reverse (1101311223121), we get a palindrome (2314532354132).
The spelling of 1213221131011 in words is "one trillion, two hundred thirteen billion, two hundred twenty-one million, one hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •