Base | Representation |
---|---|
bin | 111110010111111… |
… | …000000101010101 |
3 | 2200221001222121212 |
4 | 332113320011111 |
5 | 4120342241141 |
6 | 251500551205 |
7 | 34634435126 |
oct | 7627700525 |
9 | 2627058555 |
10 | 1046446421 |
11 | 497767759 |
12 | 252552505 |
13 | 138a4cc87 |
14 | 9cd9c04d |
15 | 61d082eb |
hex | 3e5f8155 |
1046446421 has 2 divisors, whose sum is σ = 1046446422. Its totient is φ = 1046446420.
The previous prime is 1046446393. The next prime is 1046446439. The reversal of 1046446421 is 1246446401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 761208100 + 285238321 = 27590^2 + 16889^2 .
It is an emirp because it is prime and its reverse (1246446401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1046446421 - 214 = 1046430037 is a prime.
It is a super-2 number, since 2×10464464212 = 2190100224047418482, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1046446721) 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, 523223210 + 523223211.
It is an arithmetic number, because the mean of its divisors is an integer number (523223211).
Almost surely, 21046446421 is an apocalyptic number.
It is an amenable number.
1046446421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1046446421 is an equidigital number, since it uses as much as digits as its factorization.
1046446421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 32.
The square root of 1046446421 is about 32348.8241053674. The cubic root of 1046446421 is about 1015.2484434742.
The spelling of 1046446421 in words is "one billion, forty-six million, four hundred forty-six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •