Base | Representation |
---|---|
bin | 1000011111101000111… |
… | …0010010000000110111 |
3 | 111221200020202002211201 |
4 | 2013322032102000313 |
5 | 4342332040443232 |
6 | 151012404313331 |
7 | 13354221160210 |
oct | 2077216220067 |
9 | 457606662751 |
10 | 145931968567 |
11 | 56986878a00 |
12 | 243483a2847 |
13 | 109b882b278 |
14 | 70c53ac407 |
15 | 3be18bbbe7 |
hex | 21fa392037 |
145931968567 has 48 divisors (see below), whose sum is σ = 189444161536. Its totient is φ = 109922313600.
The previous prime is 145931968549. The next prime is 145931968571. The reversal of 145931968567 is 765869139541.
It is a de Polignac number, because none of the positive numbers 2k-145931968567 is a prime.
It is a super-2 number, since 2×1459319685672 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145931968499 and 145931968508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145931968517) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 28538803 + ... + 28543915.
Almost surely, 2145931968567 is an apocalyptic number.
145931968567 is a deficient number, since it is larger than the sum of its proper divisors (43512192969).
145931968567 is a wasteful number, since it uses less digits than its factorization.
145931968567 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6260 (or 6249 counting only the distinct ones).
The product of its digits is 48988800, while the sum is 64.
The spelling of 145931968567 in words is "one hundred forty-five billion, nine hundred thirty-one million, nine hundred sixty-eight thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •