Base | Representation |
---|---|
bin | 10001110001100001000… |
… | …111010100010010100011 |
3 | 11022202122110121202210122 |
4 | 101301201013110102203 |
5 | 130002411401121011 |
6 | 2333034201150455 |
7 | 154146300605204 |
oct | 21614107242243 |
9 | 4282573552718 |
10 | 1221400020131 |
11 | 430aa1518a45 |
12 | 17887048b42b |
13 | 8b24004a305 |
14 | 4318a7295ab |
15 | 21b888023db |
hex | 11c611d44a3 |
1221400020131 has 4 divisors (see below), whose sum is σ = 1221410271000. Its totient is φ = 1221389769264.
The previous prime is 1221400020121. The next prime is 1221400020151. The reversal of 1221400020131 is 1310200041221.
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 1221400020131 - 26 = 1221400020067 is a prime.
It is a super-2 number, since 2×12214000201312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1221400020121) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 4944581 + ... + 5185718.
It is an arithmetic number, because the mean of its divisors is an integer number (305352567750).
Almost surely, 21221400020131 is an apocalyptic number.
1221400020131 is a deficient number, since it is larger than the sum of its proper divisors (10250869).
1221400020131 is a wasteful number, since it uses less digits than its factorization.
1221400020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10250868.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1221400020131 its reverse (1310200041221), we get a palindrome (2531600061352).
The spelling of 1221400020131 in words is "one trillion, two hundred twenty-one billion, four hundred million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •