Base | Representation |
---|---|
bin | 100110000001100010010… |
… | …000010111100111001101 |
3 | 100020210120122222211121102 |
4 | 212001202100113213031 |
5 | 320302400033333112 |
6 | 5320220153312445 |
7 | 356532202262153 |
oct | 46014220274715 |
9 | 10223518884542 |
10 | 2612988574157 |
11 | 918186a25395 |
12 | 3624b8705725 |
13 | 15c5330c2a00 |
14 | 9067db673d3 |
15 | 47e83291bc2 |
hex | 260624179cd |
2612988574157 has 12 divisors (see below), whose sum is σ = 2831630937300. Its totient is φ = 2410129582848.
The previous prime is 2612988574123. The next prime is 2612988574177. The reversal of 2612988574157 is 7514758892162.
It can be written as a sum of positive squares in 6 ways, for example, as 69939620521 + 2543048953636 = 264461^2 + 1594694^2 .
It is not a de Polignac number, because 2612988574157 - 218 = 2612988312013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2612988574093 and 2612988574102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2612988574177) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5741282 + ... + 6179667.
It is an arithmetic number, because the mean of its divisors is an integer number (235969244775).
Almost surely, 22612988574157 is an apocalyptic number.
It is an amenable number.
2612988574157 is a deficient number, since it is larger than the sum of its proper divisors (218642363143).
2612988574157 is a wasteful number, since it uses less digits than its factorization.
2612988574157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11922272 (or 11922259 counting only the distinct ones).
The product of its digits is 67737600, while the sum is 65.
The spelling of 2612988574157 in words is "two trillion, six hundred twelve billion, nine hundred eighty-eight million, five hundred seventy-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •