Base | Representation |
---|---|
bin | 100101010010110101010010… |
… | …110100111000010010110000 |
3 | 210111202100011220221120002010 |
4 | 211102311102310320102300 |
5 | 132444313320242120340 |
6 | 1340502341343122520 |
7 | 46356122323265466 |
oct | 4522652264702260 |
9 | 714670156846063 |
10 | 164021895660720 |
11 | 48298328070919 |
12 | 16490660ba3440 |
13 | 706a276b3c206 |
14 | 2c709b8828836 |
15 | 13e68bc6eab80 |
hex | 952d52d384b0 |
164021895660720 has 80 divisors (see below), whose sum is σ = 509976683555040. Its totient is φ = 43609382326272.
The previous prime is 164021895660713. The next prime is 164021895660823. The reversal of 164021895660720 is 27066598120461.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1640218956607202 (a number of 29 digits) contains 22 as substring.
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, 1013902155 + ... + 1014063914.
It is an arithmetic number, because the mean of its divisors is an integer number (6374708544438).
Almost surely, 2164021895660720 is an apocalyptic number.
164021895660720 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
164021895660720 is an abundant number, since it is smaller than the sum of its proper divisors (345954787894320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164021895660720 is a wasteful number, since it uses less digits than its factorization.
164021895660720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2027966422 (or 2027966416 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 57.
The spelling of 164021895660720 in words is "one hundred sixty-four trillion, twenty-one billion, eight hundred ninety-five million, six hundred sixty thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •