Base | Representation |
---|---|
bin | 11110000010010001100… |
… | …111101011101000010010 |
3 | 21022022121121200210220000 |
4 | 132002101213223220102 |
5 | 232304112003310342 |
6 | 4220111234230430 |
7 | 302056344300600 |
oct | 36022147535022 |
9 | 7268547623800 |
10 | 2064027400722 |
11 | 7263927276a1 |
12 | 294032725416 |
13 | 11c8384b7ac1 |
14 | 71c8418a870 |
15 | 38a540b944c |
hex | 1e0919eba12 |
2064027400722 has 60 divisors (see below), whose sum is σ = 5380044231870. Its totient is φ = 589722112224.
The previous prime is 2064027400703. The next prime is 2064027400727. The reversal of 2064027400722 is 2270047204602.
2064027400722 is a `hidden beast` number, since 2 + 0 + 640 + 2 + 7 + 4 + 0 + 0 + 7 + 2 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1379471391081 + 684556009641 = 1174509^2 + 827379^2 .
It is a super-2 number, since 2×20640274007222 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2064027400727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 130001347 + ... + 130017222.
Almost surely, 22064027400722 is an apocalyptic number.
2064027400722 is an abundant number, since it is smaller than the sum of its proper divisors (3316016831148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2064027400722 is a wasteful number, since it uses less digits than its factorization.
2064027400722 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260018597 (or 260018581 counting only the distinct ones).
The product of its (nonzero) digits is 75264, while the sum is 36.
The spelling of 2064027400722 in words is "two trillion, sixty-four billion, twenty-seven million, four hundred thousand, seven hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •