Base | Representation |
---|---|
bin | 100001000110001100010000… |
… | …000110011011111101110111 |
3 | 201002101111101211112110120200 |
4 | 201012030100012123331313 |
5 | 123034332420212022412 |
6 | 1233325445305131543 |
7 | 42442302304536306 |
oct | 4106142006337567 |
9 | 632344354473520 |
10 | 145561006751607 |
11 | 424200925a8687 |
12 | 143aa846789bb3 |
13 | 632b461b11c05 |
14 | 27d329433443d |
15 | 11c659865a9dc |
hex | 84631019bf77 |
145561006751607 has 6 divisors (see below), whose sum is σ = 210254787530112. Its totient is φ = 97040671167732.
The previous prime is 145561006751599. The next prime is 145561006751617. The reversal of 145561006751607 is 706157600165541.
145561006751607 is a `hidden beast` number, since 1 + 4 + 5 + 5 + 61 + 0 + 0 + 67 + 516 + 0 + 7 = 666.
It is not a de Polignac number, because 145561006751607 - 23 = 145561006751599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145561006751617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8086722597303 + ... + 8086722597320.
It is an arithmetic number, because the mean of its divisors is an integer number (35042464588352).
Almost surely, 2145561006751607 is an apocalyptic number.
145561006751607 is a deficient number, since it is larger than the sum of its proper divisors (64693780778505).
145561006751607 is a wasteful number, since it uses less digits than its factorization.
145561006751607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16173445194629 (or 16173445194626 counting only the distinct ones).
The product of its (nonzero) digits is 5292000, while the sum is 54.
The spelling of 145561006751607 in words is "one hundred forty-five trillion, five hundred sixty-one billion, six million, seven hundred fifty-one thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •