Base | Representation |
---|---|
bin | 11001000111110… |
… | …000010100000001 |
3 | 1002101001112221202 |
4 | 121013300110001 |
5 | 1330343311142 |
6 | 105453230545 |
7 | 13305243653 |
oct | 3107602401 |
9 | 1071045852 |
10 | 421463297 |
11 | 1a69a5682 |
12 | b9192455 |
13 | 69417a88 |
14 | 3dd906d3 |
15 | 27003032 |
hex | 191f0501 |
421463297 has 8 divisors (see below), whose sum is σ = 423255456. Its totient is φ = 419675872.
The previous prime is 421463249. The next prime is 421463309. The reversal of 421463297 is 792364124.
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 421463297 - 26 = 421463233 is a prime.
It is a super-2 number, since 2×4214632972 = 355262621436220418, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 421463297.
It is not an unprimeable number, because it can be changed into a prime (421463797) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 441773 + ... + 442725.
It is an arithmetic number, because the mean of its divisors is an integer number (52906932).
Almost surely, 2421463297 is an apocalyptic number.
It is an amenable number.
421463297 is a deficient number, since it is larger than the sum of its proper divisors (1792159).
421463297 is an equidigital number, since it uses as much as digits as its factorization.
421463297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2367.
The product of its digits is 72576, while the sum is 38.
The square root of 421463297 is about 20529.5712814467. The cubic root of 421463297 is about 749.7559484456.
The spelling of 421463297 in words is "four hundred twenty-one million, four hundred sixty-three thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •