Base | Representation |
---|---|
bin | 11001000110100… |
… | …010001110001011 |
3 | 1002100110022012000 |
4 | 121012202032023 |
5 | 1330303042220 |
6 | 105442322043 |
7 | 13302442266 |
oct | 3106421613 |
9 | 1070408160 |
10 | 421143435 |
11 | 1a67a7329 |
12 | b9059323 |
13 | 693352cb |
14 | 3dd09cdd |
15 | 26e8d390 |
hex | 191a238b |
421143435 has 32 divisors (see below), whose sum is σ = 768943680. Its totient is φ = 218536704.
The previous prime is 421143427. The next prime is 421143469. The reversal of 421143435 is 534341124.
It is a happy number.
It is not a de Polignac number, because 421143435 - 23 = 421143427 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 421143399 and 421143408.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37162 + ... + 47151.
It is an arithmetic number, because the mean of its divisors is an integer number (24029490).
Almost surely, 2421143435 is an apocalyptic number.
421143435 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
421143435 is a deficient number, since it is larger than the sum of its proper divisors (347800245).
421143435 is a wasteful number, since it uses less digits than its factorization.
421143435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84364 (or 84358 counting only the distinct ones).
The product of its digits is 5760, while the sum is 27.
The square root of 421143435 is about 20521.7795281014. The cubic root of 421143435 is about 749.5662291722.
Adding to 421143435 its reverse (534341124), we get a palindrome (955484559).
The spelling of 421143435 in words is "four hundred twenty-one million, one hundred forty-three thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •