Base | Representation |
---|---|
bin | 111100110111100… |
… | …100011110111001 |
3 | 2122011120100110211 |
4 | 330313210132321 |
5 | 4042411402223 |
6 | 245155511121 |
7 | 34210026250 |
oct | 7467443671 |
9 | 2564510424 |
10 | 1021200313 |
11 | 484493a01 |
12 | 245bb84a1 |
13 | 133750a53 |
14 | 998a9797 |
15 | 5e9bcd0d |
hex | 3cde47b9 |
1021200313 has 8 divisors (see below), whose sum is σ = 1183524480. Its totient is φ = 862985760.
The previous prime is 1021200307. The next prime is 1021200331. The reversal of 1021200313 is 3130021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1021200313 - 25 = 1021200281 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021200293 and 1021200302.
It is not an unprimeable number, because it can be changed into a prime (1021204313) 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, 1026868 + ... + 1027861.
It is an arithmetic number, because the mean of its divisors is an integer number (147940560).
Almost surely, 21021200313 is an apocalyptic number.
It is an amenable number.
1021200313 is a deficient number, since it is larger than the sum of its proper divisors (162324167).
1021200313 is an equidigital number, since it uses as much as digits as its factorization.
1021200313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2054807.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1021200313 is about 31956.2249491394. The cubic root of 1021200313 is about 1007.0174117438.
Adding to 1021200313 its reverse (3130021201), we get a palindrome (4151221514).
The spelling of 1021200313 in words is "one billion, twenty-one million, two hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •