Base | Representation |
---|---|
bin | 11111011110000011010… |
… | …110110100000000000000 |
3 | 21122201222101101200101210 |
4 | 133132003112310000000 |
5 | 240412422010022334 |
6 | 4333245542330120 |
7 | 312145362432255 |
oct | 37360326640000 |
9 | 7581871350353 |
10 | 2162572345344 |
11 | 764161790094 |
12 | 2ab155129940 |
13 | 128c11710618 |
14 | 76951c8742c |
15 | 3b3c06d65e9 |
hex | 1f7835b4000 |
2162572345344 has 60 divisors (see below), whose sum is σ = 5766683728064. Its totient is φ = 720857432064.
The previous prime is 2162572345343. The next prime is 2162572345397. The reversal of 2162572345344 is 4435432752612.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 2162572345293 and 2162572345302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2162572345343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21949672 + ... + 22047975.
Almost surely, 22162572345344 is an apocalyptic number.
2162572345344 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
2162572345344 is an abundant number, since it is smaller than the sum of its proper divisors (3604111382720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2162572345344 is an frugal number, since it uses more digits than its factorization.
2162572345344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43997678 (or 43997652 counting only the distinct ones).
The product of its digits is 4838400, while the sum is 48.
The spelling of 2162572345344 in words is "two trillion, one hundred sixty-two billion, five hundred seventy-two million, three hundred forty-five thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •