Base | Representation |
---|---|
bin | 110001111010001001… |
… | …1110101110111000001 |
3 | 101020122102102102112100 |
4 | 1203310103311313001 |
5 | 3224000040312103 |
6 | 121123101421013 |
7 | 10512654311556 |
oct | 1436423656701 |
9 | 336572372470 |
10 | 107178057153 |
11 | 414aa245742 |
12 | 1893186a769 |
13 | a15098913b |
14 | 528a4caa2d |
15 | 2bc44c65a3 |
hex | 18f44f5dc1 |
107178057153 has 12 divisors (see below), whose sum is σ = 155614890340. Its totient is φ = 71081819136.
The previous prime is 107178057113. The next prime is 107178057157. The reversal of 107178057153 is 351750871701.
107178057153 is a `hidden beast` number, since 1 + 0 + 7 + 1 + 78 + 0 + 571 + 5 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 10961461809 + 96216595344 = 104697^2 + 310188^2 .
It is not a de Polignac number, because 107178057153 - 214 = 107178040769 is a prime.
It is a super-2 number, since 2×1071780571532 (a number of 23 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 = 107178057099 and 107178057108.
It is not an unprimeable number, because it can be changed into a prime (107178057157) 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, 30849748 + ... + 30853221.
Almost surely, 2107178057153 is an apocalyptic number.
It is an amenable number.
107178057153 is a deficient number, since it is larger than the sum of its proper divisors (48436833187).
107178057153 is a wasteful number, since it uses less digits than its factorization.
107178057153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61703168 (or 61703165 counting only the distinct ones).
The product of its (nonzero) digits is 205800, while the sum is 45.
The spelling of 107178057153 in words is "one hundred seven billion, one hundred seventy-eight million, fifty-seven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •