Base | Representation |
---|---|
bin | 11011111111001000101… |
… | …11110110100101100000 |
3 | 10101221002012021221120220 |
4 | 31333210113312211200 |
5 | 111223333421241102 |
6 | 2013431313403040 |
7 | 126321400016556 |
oct | 15774427664540 |
9 | 3357065257526 |
10 | 961609165152 |
11 | 3408a8339509 |
12 | 136448b69480 |
13 | 6c8aa70a90c |
14 | 34783877bd6 |
15 | 1a03118e1bc |
hex | dfe45f6960 |
961609165152 has 48 divisors (see below), whose sum is σ = 2592446339952. Its totient is φ = 311873241600.
The previous prime is 961609165117. The next prime is 961609165183. The reversal of 961609165152 is 251561906169.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×9616091651522 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 961609165095 and 961609165104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135358099 + ... + 135365202.
It is an arithmetic number, because the mean of its divisors is an integer number (54009298749).
Almost surely, 2961609165152 is an apocalyptic number.
It is an amenable number.
961609165152 is an abundant number, since it is smaller than the sum of its proper divisors (1630837174800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
961609165152 is a wasteful number, since it uses less digits than its factorization.
961609165152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270723351 (or 270723343 counting only the distinct ones).
The product of its (nonzero) digits is 874800, while the sum is 51.
The spelling of 961609165152 in words is "nine hundred sixty-one billion, six hundred nine million, one hundred sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •