Base | Representation |
---|---|
bin | 111100110111010… |
… | …011101010010101 |
3 | 2122011102211221222 |
4 | 330313103222111 |
5 | 4042402201123 |
6 | 245154220125 |
7 | 34206321341 |
oct | 7467235225 |
9 | 2564384858 |
10 | 1021131413 |
11 | 484447165 |
12 | 245b84645 |
13 | 133728593 |
14 | 9988c621 |
15 | 5e9a76c8 |
hex | 3cdd3a95 |
1021131413 has 4 divisors (see below), whose sum is σ = 1054071168. Its totient is φ = 988191660.
The previous prime is 1021131409. The next prime is 1021131431. The reversal of 1021131413 is 3141311201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1021131413 - 22 = 1021131409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021131391 and 1021131400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021431413) 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, 16469831 + ... + 16469892.
It is an arithmetic number, because the mean of its divisors is an integer number (263517792).
Almost surely, 21021131413 is an apocalyptic number.
It is an amenable number.
1021131413 is a deficient number, since it is larger than the sum of its proper divisors (32939755).
1021131413 is an equidigital number, since it uses as much as digits as its factorization.
1021131413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32939754.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 1021131413 is about 31955.1468937322. The cubic root of 1021131413 is about 1006.9947635394.
Adding to 1021131413 its reverse (3141311201), we get a palindrome (4162442614).
The spelling of 1021131413 in words is "one billion, twenty-one million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •