Base | Representation |
---|---|
bin | 10110101000010100100… |
… | …011110101100110010010 |
3 | 12111200001012110202102201 |
4 | 112220110203311212102 |
5 | 200434343003200200 |
6 | 3150225205033414 |
7 | 220232254151032 |
oct | 26502443654622 |
9 | 5450035422381 |
10 | 1555123100050 |
11 | 54a5844a2323 |
12 | 2114876b586a |
13 | b3855685b80 |
14 | 553a85438c2 |
15 | 2a6bb8aec6a |
hex | 16a148f5992 |
1555123100050 has 48 divisors (see below), whose sum is σ = 3122878138632. Its totient is φ = 572752857600.
The previous prime is 1555123100039. The next prime is 1555123100053. The reversal of 1555123100050 is 500013215551.
It can be written as a sum of positive squares in 12 ways, for example, as 80775892521 + 1474347207529 = 284211^2 + 1214227^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1555123099991 and 1555123100018.
It is not an unprimeable number, because it can be changed into a prime (1555123100053) 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 23 ways as a sum of consecutive naturals, for example, 2755171 + ... + 3271270.
Almost surely, 21555123100050 is an apocalyptic number.
1555123100050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1555123100050 is an abundant number, since it is smaller than the sum of its proper divisors (1567755038582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1555123100050 is a wasteful number, since it uses less digits than its factorization.
1555123100050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6026863 (or 6026858 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 1555123100050 in words is "one trillion, five hundred fifty-five billion, one hundred twenty-three million, one hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •