Base | Representation |
---|---|
bin | 1100010000110100110… |
… | …10111100001001101000 |
3 | 1111021120121111000220111 |
4 | 12020122122330021220 |
5 | 23400411104032434 |
6 | 521322054104104 |
7 | 42304306312510 |
oct | 6103232741150 |
9 | 1437517430814 |
10 | 421350064744 |
11 | 15276a144004 |
12 | 697b134b034 |
13 | 3096b92c94b |
14 | 165718bc840 |
15 | ae60e43964 |
hex | 621a6bc268 |
421350064744 has 32 divisors (see below), whose sum is σ = 902931336000. Its totient is φ = 180570931200.
The previous prime is 421350064741. The next prime is 421350064747. The reversal of 421350064744 is 447460053124.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (421350064741) and next prime (421350064747).
It is a junction number, because it is equal to n+sod(n) for n = 421350064697 and 421350064706.
It is not an unprimeable number, because it can be changed into a prime (421350064741) 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 7 ways as a sum of consecutive naturals, for example, 1286707 + ... + 1580605.
It is an arithmetic number, because the mean of its divisors is an integer number (28216604250).
Almost surely, 2421350064744 is an apocalyptic number.
It is an amenable number.
421350064744 is an abundant number, since it is smaller than the sum of its proper divisors (481581271256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421350064744 is a wasteful number, since it uses less digits than its factorization.
421350064744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319513 (or 319509 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 40.
The spelling of 421350064744 in words is "four hundred twenty-one billion, three hundred fifty million, sixty-four thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •