Base | Representation |
---|---|
bin | 111100110111010… |
… | …011100111001101 |
3 | 2122011102211200120 |
4 | 330313103213031 |
5 | 4042402144323 |
6 | 245154215153 |
7 | 34206320634 |
oct | 7467234715 |
9 | 2564384616 |
10 | 1021131213 |
11 | 484446aa3 |
12 | 245b844b9 |
13 | 13372846b |
14 | 9988c51b |
15 | 5e9a75e3 |
hex | 3cdd39cd |
1021131213 has 8 divisors (see below), whose sum is σ = 1363753728. Its totient is φ = 679631424.
The previous prime is 1021131211. The next prime is 1021131247. The reversal of 1021131213 is 3121311201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1021131213 - 21 = 1021131211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021131192 and 1021131201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021131211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 278556 + ... + 282197.
It is an arithmetic number, because the mean of its divisors is an integer number (170469216).
Almost surely, 21021131213 is an apocalyptic number.
It is an amenable number.
1021131213 is a deficient number, since it is larger than the sum of its proper divisors (342622515).
1021131213 is an equidigital number, since it uses as much as digits as its factorization.
1021131213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561363.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1021131213 is about 31955.1437643457. The cubic root of 1021131213 is about 1006.9946977957.
Adding to 1021131213 its reverse (3121311201), we get a palindrome (4142442414).
The spelling of 1021131213 in words is "one billion, twenty-one million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •