Base | Representation |
---|---|
bin | 100100101111101011011011… |
… | …000101011010111010100000 |
3 | 210012012101122000122022220111 |
4 | 210233223123011122322200 |
5 | 132140223310432014220 |
6 | 1331412454022021104 |
7 | 46016441120361511 |
oct | 4457533305327240 |
9 | 705171560568814 |
10 | 161606115110560 |
11 | 4754684aa0a84a |
12 | 16160420b77794 |
13 | 6c235117ba783 |
14 | 2bc9ac604aa08 |
15 | 13a3b2c72b15a |
hex | 92fadb15aea0 |
161606115110560 has 96 divisors (see below), whose sum is σ = 382705114804992. Its totient is φ = 64488281518080.
The previous prime is 161606115110521. The next prime is 161606115110633. The reversal of 161606115110560 is 65011511606161.
It is a super-2 number, since 2×1616061151105602 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
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, 998036005 + ... + 998197915.
It is an arithmetic number, because the mean of its divisors is an integer number (3986511612552).
Almost surely, 2161606115110560 is an apocalyptic number.
161606115110560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
161606115110560 is an abundant number, since it is smaller than the sum of its proper divisors (221098999694432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161606115110560 is a wasteful number, since it uses less digits than its factorization.
161606115110560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176766 (or 176758 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 40.
The spelling of 161606115110560 in words is "one hundred sixty-one trillion, six hundred six billion, one hundred fifteen million, one hundred ten thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •