Base | Representation |
---|---|
bin | 10010110010001100010… |
… | …10011001111001011000 |
3 | 2021200221120210021011010 |
4 | 21121012022121321120 |
5 | 41033311042231112 |
6 | 1212300342133520 |
7 | 64426110260622 |
oct | 11310612317130 |
9 | 2250846707133 |
10 | 645422227032 |
11 | 2297a4026000 |
12 | a51067212a0 |
13 | 48b2b192c1b |
14 | 2334aa21c12 |
15 | 11bc78b063c |
hex | 9646299e58 |
645422227032 has 128 divisors (see below), whose sum is σ = 1797262617600. Its totient is φ = 193106010240.
The previous prime is 645422227013. The next prime is 645422227033. The reversal of 645422227032 is 230722224546.
It is a super-2 number, since 2×6454222270322 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (645422227033) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2395698 + ... + 2651454.
It is an arithmetic number, because the mean of its divisors is an integer number (14041114200).
Almost surely, 2645422227032 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 645422227032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (898631308800).
645422227032 is an abundant number, since it is smaller than the sum of its proper divisors (1151840390568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
645422227032 is a wasteful number, since it uses less digits than its factorization.
645422227032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 255878 (or 255852 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 39.
The spelling of 645422227032 in words is "six hundred forty-five billion, four hundred twenty-two million, two hundred twenty-seven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •