Base | Representation |
---|---|
bin | 1100010000111100110… |
… | …01010010000011110100 |
3 | 1111021202020221102212121 |
4 | 12020132121102003310 |
5 | 23401030141122220 |
6 | 521332435125324 |
7 | 42306046115332 |
oct | 6103631220364 |
9 | 1437666842777 |
10 | 421416739060 |
11 | 1527a3843449 |
12 | 6980b743844 |
13 | 3097c6a57c5 |
14 | 1657a6b6b52 |
15 | ae66c13eaa |
hex | 621e6520f4 |
421416739060 has 96 divisors (see below), whose sum is σ = 901951333920. Its totient is φ = 165367775232.
The previous prime is 421416739033. The next prime is 421416739069. The reversal of 421416739060 is 60937614124.
It can be written as a sum of positive squares in 16 ways, for example, as 313803873124 + 107612865936 = 560182^2 + 328044^2 .
It is a junction number, because it is equal to n+sod(n) for n = 421416738998 and 421416739016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421416739069) 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 31 ways as a sum of consecutive naturals, for example, 148751404 + ... + 148754236.
It is an arithmetic number, because the mean of its divisors is an integer number (9395326395).
Almost surely, 2421416739060 is an apocalyptic number.
It is an amenable number.
421416739060 is an abundant number, since it is smaller than the sum of its proper divisors (480534594860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421416739060 is a wasteful number, since it uses less digits than its factorization.
421416739060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3557 (or 3555 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 43.
The spelling of 421416739060 in words is "four hundred twenty-one billion, four hundred sixteen million, seven hundred thirty-nine thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •