Base | Representation |
---|---|
bin | 1001100110101010… |
… | …11001110101110101 |
3 | 111022100022220212200 |
4 | 10303111121311311 |
5 | 41024442404211 |
6 | 2211351335113 |
7 | 241530054144 |
oct | 46325316565 |
9 | 14270286780 |
10 | 5156216181 |
11 | 2206605596 |
12 | bba981499 |
13 | 642325cbc |
14 | 36cb2775b |
15 | 202a12b56 |
hex | 133559d75 |
5156216181 has 12 divisors (see below), whose sum is σ = 7839861120. Its totient is φ = 3256557480.
The previous prime is 5156216171. The next prime is 5156216203. The reversal of 5156216181 is 1816126515.
5156216181 is a `hidden beast` number, since 5 + 1 + 562 + 16 + 1 + 81 = 666.
It is not a de Polignac number, because 5156216181 - 27 = 5156216053 is a prime.
It is a super-2 number, since 2×51562161812 = 53173130610412449522, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5156216101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15076485 + ... + 15076826.
It is an arithmetic number, because the mean of its divisors is an integer number (653321760).
Almost surely, 25156216181 is an apocalyptic number.
It is an amenable number.
5156216181 is a deficient number, since it is larger than the sum of its proper divisors (2683644939).
5156216181 is a wasteful number, since it uses less digits than its factorization.
5156216181 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30153336 (or 30153333 counting only the distinct ones).
The product of its digits is 14400, while the sum is 36.
The square root of 5156216181 is about 71806.7975960494. The cubic root of 5156216181 is about 1727.6020304666.
The spelling of 5156216181 in words is "five billion, one hundred fifty-six million, two hundred sixteen thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •