Base | Representation |
---|---|
bin | 1001000100110011101… |
… | …1100000010111101001 |
3 | 112220102121012201101020 |
4 | 2101030323200113221 |
5 | 10023300312141103 |
6 | 155342425243053 |
7 | 14156403541344 |
oct | 2211473402751 |
9 | 486377181336 |
10 | 155909490153 |
11 | 6013692a60a |
12 | 26271933489 |
13 | 119189781b1 |
14 | 779055d45b |
15 | 40c77d9753 |
hex | 244cee05e9 |
155909490153 has 16 divisors (see below), whose sum is σ = 208089161280. Its totient is φ = 103834800576.
The previous prime is 155909490127. The next prime is 155909490161. The reversal of 155909490153 is 351094909551.
It is not a de Polignac number, because 155909490153 - 218 = 155909228009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 155909490096 and 155909490105.
It is not an unprimeable number, because it can be changed into a prime (155909490953) 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, 14341626 + ... + 14352492.
It is an arithmetic number, because the mean of its divisors is an integer number (13005572580).
Almost surely, 2155909490153 is an apocalyptic number.
It is an amenable number.
155909490153 is a deficient number, since it is larger than the sum of its proper divisors (52179671127).
155909490153 is a wasteful number, since it uses less digits than its factorization.
155909490153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15256.
The product of its (nonzero) digits is 1093500, while the sum is 51.
The spelling of 155909490153 in words is "one hundred fifty-five billion, nine hundred nine million, four hundred ninety thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •