Base | Representation |
---|---|
bin | 110110000101111001… |
… | …1101001001111010111 |
3 | 102002211112200101222020 |
4 | 1230023303221033113 |
5 | 3400400011022011 |
6 | 125210355104223 |
7 | 11251415306424 |
oct | 1541363511727 |
9 | 362745611866 |
10 | 116162204631 |
11 | 4529a599710 |
12 | 1a61a5a2073 |
13 | ac53078a35 |
14 | 589d776d4b |
15 | 304d0c1006 |
hex | 1b0bce93d7 |
116162204631 has 16 divisors (see below), whose sum is σ = 169670177280. Its totient is φ = 70106765120.
The previous prime is 116162204567. The next prime is 116162204659. The reversal of 116162204631 is 136402261611.
It is a cyclic number.
It is not a de Polignac number, because 116162204631 - 26 = 116162204567 is a prime.
It is a super-2 number, since 2×1161622046312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 116162204592 and 116162204601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116162204681) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7356270 + ... + 7372043.
It is an arithmetic number, because the mean of its divisors is an integer number (10604386080).
Almost surely, 2116162204631 is an apocalyptic number.
116162204631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
116162204631 is a deficient number, since it is larger than the sum of its proper divisors (53507972649).
116162204631 is a wasteful number, since it uses less digits than its factorization.
116162204631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14728566.
The product of its (nonzero) digits is 10368, while the sum is 33.
The spelling of 116162204631 in words is "one hundred sixteen billion, one hundred sixty-two million, two hundred four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •