Base | Representation |
---|---|
bin | 11010011101010101000110… |
… | …001010101110001010010000 |
3 | 120021000100200211201021122202 |
4 | 122131111012022232022100 |
5 | 110223004424344304120 |
6 | 1051253114530222332 |
7 | 33340034251346243 |
oct | 3235250612561220 |
9 | 507010624637582 |
10 | 116364726166160 |
11 | 3409400433154a |
12 | 1107431b4249a8 |
13 | 4cc11ba0aca54 |
14 | 20a41232a525a |
15 | d6bda8472875 |
hex | 69d5462ae290 |
116364726166160 has 40 divisors (see below), whose sum is σ = 271679988332160. Its totient is φ = 46351137779072.
The previous prime is 116364726166151. The next prime is 116364726166229. The reversal of 116364726166160 is 61661627463611.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 116364726166096 and 116364726166105.
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, 3042991502 + ... + 3043029741.
It is an arithmetic number, because the mean of its divisors is an integer number (6791999708304).
Almost surely, 2116364726166160 is an apocalyptic number.
116364726166160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116364726166160 is an abundant number, since it is smaller than the sum of its proper divisors (155315262166000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116364726166160 is a wasteful number, since it uses less digits than its factorization.
116364726166160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6086021495 (or 6086021489 counting only the distinct ones).
The product of its (nonzero) digits is 7838208, while the sum is 56.
The spelling of 116364726166160 in words is "one hundred sixteen trillion, three hundred sixty-four billion, seven hundred twenty-six million, one hundred sixty-six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •