Base | Representation |
---|---|
bin | 1001000111001010111000100… |
… | …1010110110010100110000000 |
3 | 10010002022100010110100212102100 |
4 | 2101302232021112302212000 |
5 | 1133020424220330241003 |
6 | 10151420131023550400 |
7 | 252026222630464323 |
oct | 22162561126624600 |
9 | 3102270113325370 |
10 | 641202267040128 |
11 | 1763413996a9992 |
12 | 5bab9365a5b400 |
13 | 216a2164263c41 |
14 | b44a4d8da07ba |
15 | 4e1e220b35ba3 |
hex | 2472b895b2980 |
641202267040128 has 96 divisors (see below), whose sum is σ = 1845137648357640. Its totient is φ = 213732776226816.
The previous prime is 641202267040123. The next prime is 641202267040199. The reversal of 641202267040128 is 821040762202146.
641202267040128 is a `hidden beast` number, since 6 + 4 + 12 + 0 + 226 + 7 + 0 + 401 + 2 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×6412022670401282 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (641202267040123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 195832600 + ... + 199079912.
Almost surely, 2641202267040128 is an apocalyptic number.
It is an amenable number.
641202267040128 is an abundant number, since it is smaller than the sum of its proper divisors (1203935381317512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
641202267040128 is a wasteful number, since it uses less digits than its factorization.
641202267040128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3418736 (or 3418721 counting only the distinct ones).
The product of its (nonzero) digits is 516096, while the sum is 45.
The spelling of 641202267040128 in words is "six hundred forty-one trillion, two hundred two billion, two hundred sixty-seven million, forty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •