Base | Representation |
---|---|
bin | 11001000110010… |
… | …111101000000000 |
3 | 1002100101002122111 |
4 | 121012113220000 |
5 | 1330300200112 |
6 | 105441345104 |
7 | 13302201613 |
oct | 3106275000 |
9 | 1070332574 |
10 | 421100032 |
11 | 1a6777761 |
12 | b9038194 |
13 | 6931b622 |
14 | 3dcd817a |
15 | 26e805a7 |
hex | 19197a00 |
421100032 has 80 divisors (see below), whose sum is σ = 890157312. Its totient is φ = 198696960.
The previous prime is 421100011. The next prime is 421100033. The reversal of 421100032 is 230001124.
It is a junction number, because it is equal to n+sod(n) for n = 421099985 and 421100021.
It is not an unprimeable number, because it can be changed into a prime (421100033) 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, 682188 + ... + 682804.
Almost surely, 2421100032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 421100032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (445078656).
421100032 is an abundant number, since it is smaller than the sum of its proper divisors (469057280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421100032 is an equidigital number, since it uses as much as digits as its factorization.
421100032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709 (or 693 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 421100032 is about 20520.7220145881. The cubic root of 421100032 is about 749.5404782142.
Adding to 421100032 its reverse (230001124), we get a palindrome (651101156).
The spelling of 421100032 in words is "four hundred twenty-one million, one hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •