Base | Representation |
---|---|
bin | 11001000111101… |
… | …100001010101000 |
3 | 1002101000200122200 |
4 | 121013230022220 |
5 | 1330342240222 |
6 | 105453020200 |
7 | 13305143310 |
oct | 3107541250 |
9 | 1071020580 |
10 | 421446312 |
11 | 1a6993941 |
12 | b9184660 |
13 | 69410121 |
14 | 3dd88440 |
15 | 26eeceac |
hex | 191ec2a8 |
421446312 has 48 divisors (see below), whose sum is σ = 1304478240. Its totient is φ = 120413088.
The previous prime is 421446307. The next prime is 421446313. The reversal of 421446312 is 213644124.
It is a happy number.
421446312 is a `hidden beast` number, since 4 + 21 + 4 + 4 + 631 + 2 = 666.
It is a nude number because it is divisible by every one of its digits.
It is not an unprimeable number, because it can be changed into a prime (421446313) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 417598 + ... + 418605.
It is an arithmetic number, because the mean of its divisors is an integer number (27176630).
Almost surely, 2421446312 is an apocalyptic number.
421446312 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
421446312 is an abundant number, since it is smaller than the sum of its proper divisors (883031928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421446312 is a wasteful number, since it uses less digits than its factorization.
421446312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836222 (or 836215 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
The square root of 421446312 is about 20529.1576057080. The cubic root of 421446312 is about 749.7458765714.
The spelling of 421446312 in words is "four hundred twenty-one million, four hundred forty-six thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •