Base | Representation |
---|---|
bin | 1001000011101101110… |
… | …0010101001010011101 |
3 | 112212200011011012202210 |
4 | 2100323130111022131 |
5 | 10022200210330432 |
6 | 155253345111033 |
7 | 14146212032364 |
oct | 2207334251235 |
9 | 485604135683 |
10 | 155616105117 |
11 | 5aaa6264040 |
12 | 261ab628479 |
13 | 1189cc55295 |
14 | 77635cc7db |
15 | 40abb858cc |
hex | 243b71529d |
155616105117 has 16 divisors (see below), whose sum is σ = 226445878080. Its totient is φ = 94273132800.
The previous prime is 155616105083. The next prime is 155616105121. The reversal of 155616105117 is 711501616551.
155616105117 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 155616105117 - 210 = 155616104093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155616105157) 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 15 ways as a sum of consecutive naturals, for example, 911692 + ... + 1068837.
It is an arithmetic number, because the mean of its divisors is an integer number (14152867380).
Almost surely, 2155616105117 is an apocalyptic number.
It is an amenable number.
155616105117 is a deficient number, since it is larger than the sum of its proper divisors (70829772963).
155616105117 is a wasteful number, since it uses less digits than its factorization.
155616105117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1982924.
The product of its (nonzero) digits is 31500, while the sum is 39.
The spelling of 155616105117 in words is "one hundred fifty-five billion, six hundred sixteen million, one hundred five thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •