Base | Representation |
---|---|
bin | 11001000110110… |
… | …000101000000011 |
3 | 1002100120022010012 |
4 | 121012300220003 |
5 | 1330311434220 |
6 | 105443455135 |
7 | 13303106303 |
oct | 3106605003 |
9 | 1070508105 |
10 | 421202435 |
11 | 1a6837695 |
12 | b90874ab |
13 | 69356114 |
14 | 3dd23603 |
15 | 26ea0ac5 |
hex | 191b0a03 |
421202435 has 4 divisors (see below), whose sum is σ = 505442928. Its totient is φ = 336961944.
The previous prime is 421202371. The next prime is 421202447. The reversal of 421202435 is 534202124.
It is a happy number.
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 421202435 - 26 = 421202371 is a prime.
It is a super-2 number, since 2×4212024352 = 354822982499858450, 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 421202435.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 42120239 + ... + 42120248.
It is an arithmetic number, because the mean of its divisors is an integer number (126360732).
Almost surely, 2421202435 is an apocalyptic number.
421202435 is a deficient number, since it is larger than the sum of its proper divisors (84240493).
421202435 is an equidigital number, since it uses as much as digits as its factorization.
421202435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84240492.
The product of its (nonzero) digits is 1920, while the sum is 23.
The square root of 421202435 is about 20523.2169749287. The cubic root of 421202435 is about 749.6012309782.
Adding to 421202435 its reverse (534202124), we get a palindrome (955404559).
The spelling of 421202435 in words is "four hundred twenty-one million, two hundred two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •