Base | Representation |
---|---|
bin | 1001000010000000001… |
… | …1100001001110101001 |
3 | 112211111010112202100020 |
4 | 2100200003201032221 |
5 | 10020230043203410 |
6 | 155140012431053 |
7 | 14131632322311 |
oct | 2204003411651 |
9 | 484433482306 |
10 | 155156616105 |
11 | 5a88a957157 |
12 | 260a1778489 |
13 | 118289b54aa |
14 | 771c580441 |
15 | 4081670a70 |
hex | 24200e13a9 |
155156616105 has 8 divisors (see below), whose sum is σ = 248250585792. Its totient is φ = 82750195248.
The previous prime is 155156616049. The next prime is 155156616133. The reversal of 155156616105 is 501616651551.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 155156616105 - 28 = 155156615849 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5171887189 + ... + 5171887218.
It is an arithmetic number, because the mean of its divisors is an integer number (31031323224).
Almost surely, 2155156616105 is an apocalyptic number.
155156616105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
155156616105 is a deficient number, since it is larger than the sum of its proper divisors (93093969687).
155156616105 is a wasteful number, since it uses less digits than its factorization.
155156616105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10343774415.
The product of its (nonzero) digits is 135000, while the sum is 42.
The spelling of 155156616105 in words is "one hundred fifty-five billion, one hundred fifty-six million, six hundred sixteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •