Base | Representation |
---|---|
bin | 111100110111111… |
… | …100110111111101 |
3 | 2122011202102112010 |
4 | 330313330313331 |
5 | 4042423101341 |
6 | 245202001433 |
7 | 34210623444 |
oct | 7467746775 |
9 | 2564672463 |
10 | 1021300221 |
11 | 484551a77 |
12 | 246046279 |
13 | 133787376 |
14 | 998d3d5b |
15 | 5e9dc716 |
hex | 3cdfcdfd |
1021300221 has 8 divisors (see below), whose sum is σ = 1408690080. Its totient is φ = 657388592.
The previous prime is 1021300199. The next prime is 1021300249. The reversal of 1021300221 is 1220031201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1021300221 - 26 = 1021300157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021300197 and 1021300206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021300121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5869455 + ... + 5869628.
It is an arithmetic number, because the mean of its divisors is an integer number (176086260).
Almost surely, 21021300221 is an apocalyptic number.
It is an amenable number.
1021300221 is a deficient number, since it is larger than the sum of its proper divisors (387389859).
1021300221 is a wasteful number, since it uses less digits than its factorization.
1021300221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11739115.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 1021300221 is about 31957.7881118203. The cubic root of 1021300221 is about 1007.0502508167.
Adding to 1021300221 its reverse (1220031201), we get a palindrome (2241331422).
The spelling of 1021300221 in words is "one billion, twenty-one million, three hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •