Base | Representation |
---|---|
bin | 1001000011011111000… |
… | …1100011100011111100 |
3 | 112212111212100102002100 |
4 | 2100313301203203330 |
5 | 10022033431412002 |
6 | 155243310025100 |
7 | 14144533642320 |
oct | 2206761434374 |
9 | 485455312070 |
10 | 155554560252 |
11 | 5aa74548513 |
12 | 26192aa8190 |
13 | 118902870c0 |
14 | 775936b980 |
15 | 40a657a11c |
hex | 2437c638fc |
155554560252 has 72 divisors (see below), whose sum is σ = 483947530976. Its totient is φ = 41025377664.
The previous prime is 155554560197. The next prime is 155554560253. The reversal of 155554560252 is 252065455551.
155554560252 is a `hidden beast` number, since 1 + 5 + 55 + 545 + 6 + 0 + 2 + 52 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 155554560198 and 155554560207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155554560253) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23738263 + ... + 23744814.
Almost surely, 2155554560252 is an apocalyptic number.
155554560252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
155554560252 is an abundant number, since it is smaller than the sum of its proper divisors (328392970724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155554560252 is a wasteful number, since it uses less digits than its factorization.
155554560252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47483107 (or 47483102 counting only the distinct ones).
The product of its (nonzero) digits is 1500000, while the sum is 45.
It can be divided in two parts, 155554 and 560252, that added together give a triangular number (715806 = T1196).
The spelling of 155554560252 in words is "one hundred fifty-five billion, five hundred fifty-four million, five hundred sixty thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •