Base | Representation |
---|---|
bin | 10111000101111010001101… |
… | …010010110100001011100100 |
3 | 111022121011010100211102112000 |
4 | 113011322031102310023210 |
5 | 101302434232300412441 |
6 | 1000000320041525300 |
7 | 30251360254326666 |
oct | 2705721522641344 |
9 | 438534110742460 |
10 | 101561167200996 |
11 | 2a3a6938210a48 |
12 | b4832994a3830 |
13 | 448923ba68bb9 |
14 | 1b1182dd64536 |
15 | bb1c8bac92b6 |
hex | 5c5e8d4b42e4 |
101561167200996 has 48 divisors (see below), whose sum is σ = 263901101755200. Its totient is φ = 33777303146496.
The previous prime is 101561167200953. The next prime is 101561167201033. The reversal of 101561167200996 is 699002761165101.
101561167200996 is a `hidden beast` number, since 1 + 0 + 1 + 561 + 1 + 6 + 72 + 0 + 0 + 9 + 9 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
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 15 ways as a sum of consecutive naturals, for example, 1061330461 + ... + 1061426148.
It is an arithmetic number, because the mean of its divisors is an integer number (5497939619900).
Almost surely, 2101561167200996 is an apocalyptic number.
It is an amenable number.
101561167200996 is an abundant number, since it is smaller than the sum of its proper divisors (162339934554204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101561167200996 is a wasteful number, since it uses less digits than its factorization.
101561167200996 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2122757065 (or 2122757057 counting only the distinct ones).
The product of its (nonzero) digits is 1224720, while the sum is 54.
The spelling of 101561167200996 in words is "one hundred one trillion, five hundred sixty-one billion, one hundred sixty-seven million, two hundred thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •