Base | Representation |
---|---|
bin | 1001100001001100… |
… | …0001101100110111 |
3 | 20121001220202221001 |
4 | 2120103001230313 |
5 | 20213102441120 |
6 | 1101313104131 |
7 | 120214125445 |
oct | 23023015467 |
9 | 6531822831 |
10 | 2555124535 |
11 | 10a1334977 |
12 | 5b3858047 |
13 | 319490212 |
14 | 1a34bdb95 |
15 | ee4b8e0a |
hex | 984c1b37 |
2555124535 has 8 divisors (see below), whose sum is σ = 3067631136. Its totient is φ = 2043111840.
The previous prime is 2555124527. The next prime is 2555124553. The reversal of 2555124535 is 5354215552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2555124535 - 23 = 2555124527 is a prime.
It is a super-2 number, since 2×25551245352 = 13057322778717932450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2555124494 and 2555124503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111996 + ... + 132865.
It is an arithmetic number, because the mean of its divisors is an integer number (383453892).
Almost surely, 22555124535 is an apocalyptic number.
2555124535 is a deficient number, since it is larger than the sum of its proper divisors (512506601).
2555124535 is a wasteful number, since it uses less digits than its factorization.
2555124535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246953.
The product of its digits is 150000, while the sum is 37.
The square root of 2555124535 is about 50548.2396825053. The cubic root of 2555124535 is about 1367.1117754678. Note that the first 3 decimals are identical.
It can be divided in two parts, 25551 and 24535, that added together give a triangular number (50086 = T316).
The spelling of 2555124535 in words is "two billion, five hundred fifty-five million, one hundred twenty-four thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •