Base | Representation |
---|---|
bin | 100101100011010001011101… |
… | …011100000011011101000000 |
3 | 210122202100021110020111122121 |
4 | 211203101131130003131000 |
5 | 133121321034411213211 |
6 | 1343125342021414024 |
7 | 46533545563502503 |
oct | 4543213534033500 |
9 | 718670243214577 |
10 | 165151650101056 |
11 | 4869346aa95273 |
12 | 166335b556a314 |
13 | 711c970162ca8 |
14 | 2cad54d89913a |
15 | 1415e9046c271 |
hex | 96345d703740 |
165151650101056 has 56 divisors (see below), whose sum is σ = 330377169104640. Its totient is φ = 81907966651392.
The previous prime is 165151650101029. The next prime is 165151650101063. The reversal of 165151650101056 is 650101056151561.
It is a super-2 number, since 2×1651516501010562 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3558481 + ... + 18519343.
It is an arithmetic number, because the mean of its divisors is an integer number (5899592305440).
Almost surely, 2165151650101056 is an apocalyptic number.
165151650101056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
165151650101056 is an abundant number, since it is smaller than the sum of its proper divisors (165225519003584).
165151650101056 is a wasteful number, since it uses less digits than its factorization.
165151650101056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14962271 (or 14962261 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 43.
The spelling of 165151650101056 in words is "one hundred sixty-five trillion, one hundred fifty-one billion, six hundred fifty million, one hundred one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •