Base | Representation |
---|---|
bin | 11101101110100001101… |
… | …10100110101001000011 |
3 | 10121122102220102022022012 |
4 | 32313100312212221003 |
5 | 113213322233133011 |
6 | 2101121351203135 |
7 | 133536344104004 |
oct | 16672066465103 |
9 | 3548386368265 |
10 | 1021411224131 |
11 | 3641a600a551 |
12 | 145b586764ab |
13 | 7541b151a2c |
14 | 37617d231ab |
15 | 1b881342a8b |
hex | edd0da6a43 |
1021411224131 has 4 divisors (see below), whose sum is σ = 1021417032552. Its totient is φ = 1021405415712.
The previous prime is 1021411224091. The next prime is 1021411224143. The reversal of 1021411224131 is 1314221141201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1021411224131 is a prime.
It is a super-2 number, since 2×10214112241312 (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 = 1021411224097 and 1021411224106.
It is not an unprimeable number, because it can be changed into a prime (1021411224151) 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, 2631926 + ... + 2994971.
It is an arithmetic number, because the mean of its divisors is an integer number (255354258138).
Almost surely, 21021411224131 is an apocalyptic number.
1021411224131 is a deficient number, since it is larger than the sum of its proper divisors (5808421).
1021411224131 is an equidigital number, since it uses as much as digits as its factorization.
1021411224131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5808420.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 1021411224131 its reverse (1314221141201), we get a palindrome (2335632365332).
The spelling of 1021411224131 in words is "one trillion, twenty-one billion, four hundred eleven million, two hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •