Base | Representation |
---|---|
bin | 1000011111000010000… |
… | …0010011001000101101 |
3 | 111221020212221100200222 |
4 | 2013300200103020231 |
5 | 4342013320411342 |
6 | 150544301501125 |
7 | 13350201241610 |
oct | 2076040231055 |
9 | 457225840628 |
10 | 145768919597 |
11 | 56902833894 |
12 | 243018717a5 |
13 | 10990b10aa2 |
14 | 70ab888177 |
15 | 3bd2410ed2 |
hex | 21f081322d |
145768919597 has 4 divisors (see below), whose sum is σ = 166593050976. Its totient is φ = 124944788220.
The previous prime is 145768919579. The next prime is 145768919629. The reversal of 145768919597 is 795919867541.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 795919867541 = 61 ⋅13047866681.
It is not a de Polignac number, because 145768919597 - 214 = 145768903213 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145768919597.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145768919567) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10412065679 + ... + 10412065692.
It is an arithmetic number, because the mean of its divisors is an integer number (41648262744).
Almost surely, 2145768919597 is an apocalyptic number.
It is an amenable number.
145768919597 is a deficient number, since it is larger than the sum of its proper divisors (20824131379).
145768919597 is an equidigital number, since it uses as much as digits as its factorization.
145768919597 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20824131378.
The product of its digits is 171460800, while the sum is 71.
The spelling of 145768919597 in words is "one hundred forty-five billion, seven hundred sixty-eight million, nine hundred nineteen thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •