Base | Representation |
---|---|
bin | 10001110001010110000… |
… | …001110010110111011011 |
3 | 11022202011111122010212212 |
4 | 101301112001302313123 |
5 | 130002021242220011 |
6 | 2333003514425335 |
7 | 154141551631664 |
oct | 21612601626733 |
9 | 4282144563785 |
10 | 1221214023131 |
11 | 430a0652a713 |
12 | 17881a13224b |
13 | 8b21065690b |
14 | 4316db5036b |
15 | 21b7731208b |
hex | 11c56072ddb |
1221214023131 has 4 divisors (see below), whose sum is σ = 1221232176552. Its totient is φ = 1221195869712.
The previous prime is 1221214023101. The next prime is 1221214023167. The reversal of 1221214023131 is 1313204121221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1221214023131 - 26 = 1221214023067 is a prime.
It is a super-2 number, since 2×12212140231312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1221214023097 and 1221214023106.
It is not an unprimeable number, because it can be changed into a prime (1221214023101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8975426 + ... + 9110471.
It is an arithmetic number, because the mean of its divisors is an integer number (305308044138).
Almost surely, 21221214023131 is an apocalyptic number.
1221214023131 is a deficient number, since it is larger than the sum of its proper divisors (18153421).
1221214023131 is an equidigital number, since it uses as much as digits as its factorization.
1221214023131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18153420.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1221214023131 its reverse (1313204121221), we get a palindrome (2534418144352).
The spelling of 1221214023131 in words is "one trillion, two hundred twenty-one billion, two hundred fourteen million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •