Base | Representation |
---|---|
bin | 111100111000011… |
… | …010011010011101 |
3 | 2122011222120111022 |
4 | 330320122122131 |
5 | 4042440434323 |
6 | 245204333525 |
7 | 34211636261 |
oct | 7470323235 |
9 | 2564876438 |
10 | 1021421213 |
11 | 48462496a |
12 | 2460a42a5 |
13 | 1337ca467 |
14 | 999260a1 |
15 | 5ea134c8 |
hex | 3ce1a69d |
1021421213 has 2 divisors, whose sum is σ = 1021421214. Its totient is φ = 1021421212.
The previous prime is 1021421207. The next prime is 1021421239. The reversal of 1021421213 is 3121241201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 974813284 + 46607929 = 31222^2 + 6827^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021421213 - 28 = 1021420957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021421191 and 1021421200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1021421273) 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 as a sum of consecutive naturals, namely, 510710606 + 510710607.
It is an arithmetic number, because the mean of its divisors is an integer number (510710607).
Almost surely, 21021421213 is an apocalyptic number.
It is an amenable number.
1021421213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021421213 is an equidigital number, since it uses as much as digits as its factorization.
1021421213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1021421213 is about 31959.6810528516. The cubic root of 1021421213 is about 1007.0900171885.
Adding to 1021421213 its reverse (3121241201), we get a palindrome (4142662414).
The spelling of 1021421213 in words is "one billion, twenty-one million, four hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •