Base | Representation |
---|---|
bin | 11110000110101001… |
… | …11110000100100101 |
3 | 1112201100120102211220 |
4 | 33003110332010211 |
5 | 231044430044013 |
6 | 11231422450553 |
7 | 1111336234431 |
oct | 170324760445 |
9 | 45640512756 |
10 | 16161956133 |
11 | 6944003944 |
12 | 3170733a59 |
13 | 16a74b016b |
14 | ad468d9c1 |
15 | 648d37b23 |
hex | 3c353e125 |
16161956133 has 8 divisors (see below), whose sum is σ = 21750670368. Its totient is φ = 10673939664.
The previous prime is 16161956123. The next prime is 16161956137. The reversal of 16161956133 is 33165916161.
It is a happy number.
16161956133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16161956133 - 25 = 16161956101 is a prime.
It is a super-2 number, since 2×161619561332 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16161956137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25174066 + ... + 25174707.
It is an arithmetic number, because the mean of its divisors is an integer number (2718833796).
Almost surely, 216161956133 is an apocalyptic number.
It is an amenable number.
16161956133 is a deficient number, since it is larger than the sum of its proper divisors (5588714235).
16161956133 is a wasteful number, since it uses less digits than its factorization.
16161956133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50348883.
The product of its digits is 87480, while the sum is 42.
The spelling of 16161956133 in words is "sixteen billion, one hundred sixty-one million, nine hundred fifty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •