Base | Representation |
---|---|
bin | 11001001001101… |
… | …010111110010111 |
3 | 1002102000002010222 |
4 | 121021222332113 |
5 | 1331010400334 |
6 | 105512104555 |
7 | 13312435520 |
oct | 3111527627 |
9 | 1072002128 |
10 | 421965719 |
11 | 1a72090aa |
12 | b939515b |
13 | 69562676 |
14 | 40081847 |
15 | 270a1d2e |
hex | 1926af97 |
421965719 has 4 divisors (see below), whose sum is σ = 482246544. Its totient is φ = 361684896.
The previous prime is 421965647. The next prime is 421965749. The reversal of 421965719 is 917569124.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 421965719 - 216 = 421900183 is a prime.
It is a super-2 number, since 2×4219657192 = 356110136022373922, 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 421965719.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421965749) 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 in 3 ways as a sum of consecutive naturals, for example, 30140402 + ... + 30140415.
It is an arithmetic number, because the mean of its divisors is an integer number (120561636).
Almost surely, 2421965719 is an apocalyptic number.
421965719 is a deficient number, since it is larger than the sum of its proper divisors (60280825).
421965719 is an equidigital number, since it uses as much as digits as its factorization.
421965719 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60280824.
The product of its digits is 136080, while the sum is 44.
The square root of 421965719 is about 20541.8041807432. The cubic root of 421965719 is about 750.0537555544.
The spelling of 421965719 in words is "four hundred twenty-one million, nine hundred sixty-five thousand, seven hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •