Base | Representation |
---|---|
bin | 111011100111101… |
… | …110101001010101 |
3 | 2120201012000001122 |
4 | 323213232221111 |
5 | 4022032123141 |
6 | 243131133325 |
7 | 33534105203 |
oct | 7347565125 |
9 | 2521160048 |
10 | 1000270421 |
11 | 473698a77 |
12 | 23aba4245 |
13 | 12c3032b7 |
14 | 96bbc073 |
15 | 5cc3664b |
hex | 3b9eea55 |
1000270421 has 2 divisors, whose sum is σ = 1000270422. Its totient is φ = 1000270420.
The previous prime is 1000270379. The next prime is 1000270451. The reversal of 1000270421 is 1240720001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 967894321 + 32376100 = 31111^2 + 5690^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000270421 - 218 = 1000008277 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1000270421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000270451) 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 as a sum of consecutive naturals, namely, 500135210 + 500135211.
It is an arithmetic number, because the mean of its divisors is an integer number (500135211).
Almost surely, 21000270421 is an apocalyptic number.
It is an amenable number.
1000270421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000270421 is an equidigital number, since it uses as much as digits as its factorization.
1000270421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 17.
The square root of 1000270421 is about 31627.0520440967. The cubic root of 1000270421 is about 1000.0901322093.
Adding to 1000270421 its reverse (1240720001), we get a palindrome (2240990422).
The spelling of 1000270421 in words is "one billion, two hundred seventy thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •