Base | Representation |
---|---|
bin | 1001100101011110… |
… | …1010001011101000 |
3 | 20122022202211202122 |
4 | 2121113222023220 |
5 | 20232204204021 |
6 | 1103154450412 |
7 | 120523061213 |
oct | 23127521350 |
9 | 6568684678 |
10 | 2573116136 |
11 | 1100503268 |
12 | 5b9893a08 |
13 | 32011c436 |
14 | 1a5a4477a |
15 | 100d6ebab |
hex | 995ea2e8 |
2573116136 has 8 divisors (see below), whose sum is σ = 4824592770. Its totient is φ = 1286558064.
The previous prime is 2573116111. The next prime is 2573116151. The reversal of 2573116136 is 6316113752.
2573116136 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 2287708900 + 285407236 = 47830^2 + 16894^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-3 number, since 3×25731161363 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2573116096 and 2573116105.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160819751 + ... + 160819766.
Almost surely, 22573116136 is an apocalyptic number.
It is an amenable number.
2573116136 is a deficient number, since it is larger than the sum of its proper divisors (2251476634).
2573116136 is a wasteful number, since it uses less digits than its factorization.
2573116136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 321639523 (or 321639519 counting only the distinct ones).
The product of its digits is 22680, while the sum is 35.
The square root of 2573116136 is about 50725.8921656386. The cubic root of 2573116136 is about 1370.3130575539.
Adding to 2573116136 its reverse (6316113752), we get a palindrome (8889229888).
The spelling of 2573116136 in words is "two billion, five hundred seventy-three million, one hundred sixteen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •