Base | Representation |
---|---|
bin | 1000011111110000100… |
… | …1010110000001011001 |
3 | 111221202111110002102100 |
4 | 2013330021112001121 |
5 | 4342413320304242 |
6 | 151015515554013 |
7 | 13355062321110 |
oct | 2077411260131 |
9 | 457674402370 |
10 | 145964228697 |
11 | 569a3002471 |
12 | 2435715b909 |
13 | 109c2414bc1 |
14 | 70c97a8c77 |
15 | 3be464054c |
hex | 21fc256059 |
145964228697 has 48 divisors (see below), whose sum is σ = 245186742528. Its totient is φ = 81951972480.
The previous prime is 145964228677. The next prime is 145964228719. The reversal of 145964228697 is 796822469541.
145964228697 is a `hidden beast` number, since 1 + 45 + 9 + 6 + 422 + 86 + 97 = 666.
It is not a de Polignac number, because 145964228697 - 215 = 145964195929 is a prime.
It is a super-2 number, since 2×1459642286972 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (145964228677) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1254903 + ... + 1366275.
It is an arithmetic number, because the mean of its divisors is an integer number (5108057136).
Almost surely, 2145964228697 is an apocalyptic number.
It is an amenable number.
145964228697 is a deficient number, since it is larger than the sum of its proper divisors (99222513831).
145964228697 is a wasteful number, since it uses less digits than its factorization.
145964228697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111750 (or 111747 counting only the distinct ones).
The product of its digits is 52254720, while the sum is 63.
The spelling of 145964228697 in words is "one hundred forty-five billion, nine hundred sixty-four million, two hundred twenty-eight thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •