Base | Representation |
---|---|
bin | 1100010011010011010… |
… | …00101010010011111000 |
3 | 1111102000020020002001220 |
4 | 12021221220222103320 |
5 | 23411121314434002 |
6 | 522102011112040 |
7 | 42352244513403 |
oct | 6115150522370 |
9 | 1442006202056 |
10 | 422679061752 |
11 | 153291347142 |
12 | 69b02442620 |
13 | 30b2107b1cc |
14 | 1665a1cad3a |
15 | aedc9607bc |
hex | 6269a2a4f8 |
422679061752 has 64 divisors (see below), whose sum is σ = 1113393427200. Its totient is φ = 133347985920.
The previous prime is 422679061729. The next prime is 422679061787. The reversal of 422679061752 is 257160976224.
It is a junction number, because it is equal to n+sod(n) for n = 422679061695 and 422679061704.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20608 + ... + 919664.
It is an arithmetic number, because the mean of its divisors is an integer number (17396772300).
Almost surely, 2422679061752 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 422679061752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (556696713600).
422679061752 is an abundant number, since it is smaller than the sum of its proper divisors (690714365448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
422679061752 is a wasteful number, since it uses less digits than its factorization.
422679061752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 900116 (or 900112 counting only the distinct ones).
The product of its (nonzero) digits is 2540160, while the sum is 51.
It can be divided in two parts, 42267 and 9061752, that added together give a palindrome (9104019).
The spelling of 422679061752 in words is "four hundred twenty-two billion, six hundred seventy-nine million, sixty-one thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •