Base | Representation |
---|---|
bin | 10001110101001100001… |
… | …11001001100101011001 |
3 | 2011120102011220221221102 |
4 | 20322212013021211121 |
5 | 40014223043420103 |
6 | 1145242512321145 |
7 | 62156406116630 |
oct | 10724607114531 |
9 | 2146364827842 |
10 | 612672248153 |
11 | 21691856a159 |
12 | 9a8a68431b5 |
13 | 45a0c1657b4 |
14 | 21921294517 |
15 | 10e0c62ce88 |
hex | 8ea61c9959 |
612672248153 has 12 divisors (see below), whose sum is σ = 743807734272. Its totient is φ = 494256601920.
The previous prime is 612672248147. The next prime is 612672248161. The reversal of 612672248153 is 351842276216.
It is not a de Polignac number, because 612672248153 - 24 = 612672248137 is a prime.
It is a super-2 number, since 2×6126722481532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 612672248098 and 612672248107.
It is not an unprimeable number, because it can be changed into a prime (612672248183) 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 11 ways as a sum of consecutive naturals, for example, 151424633 + ... + 151428678.
It is an arithmetic number, because the mean of its divisors is an integer number (61983977856).
Almost surely, 2612672248153 is an apocalyptic number.
It is an amenable number.
612672248153 is a deficient number, since it is larger than the sum of its proper divisors (131135486119).
612672248153 is a wasteful number, since it uses less digits than its factorization.
612672248153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302853352 (or 302853335 counting only the distinct ones).
The product of its digits is 967680, while the sum is 47.
The spelling of 612672248153 in words is "six hundred twelve billion, six hundred seventy-two million, two hundred forty-eight thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •