Base | Representation |
---|---|
bin | 1100001110101110110… |
… | …11101010011010010000 |
3 | 1111011200021200210220110 |
4 | 12013113123222122100 |
5 | 23341110400241002 |
6 | 521014345241320 |
7 | 42234411413010 |
oct | 6072733523220 |
9 | 1434607623813 |
10 | 420226180752 |
11 | 1522427a6364 |
12 | 69538a93240 |
13 | 3081cb38a31 |
14 | 164a6523c40 |
15 | ade7440e6c |
hex | 61d76ea690 |
420226180752 has 320 divisors, whose sum is σ = 1331069091840. Its totient is φ = 111576268800.
The previous prime is 420226180729. The next prime is 420226180807. The reversal of 420226180752 is 257081622024.
It is a self number, because there is not a number n which added to its sum of digits gives 420226180752.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 89009752 + ... + 89014472.
It is an arithmetic number, because the mean of its divisors is an integer number (4159590912).
Almost surely, 2420226180752 is an apocalyptic number.
420226180752 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 420226180752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (665534545920).
420226180752 is an abundant number, since it is smaller than the sum of its proper divisors (910842911088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
420226180752 is a wasteful number, since it uses less digits than its factorization.
420226180752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5022 (or 5016 counting only the distinct ones).
The product of its (nonzero) digits is 107520, while the sum is 39.
The spelling of 420226180752 in words is "four hundred twenty billion, two hundred twenty-six million, one hundred eighty thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •