Base | Representation |
---|---|
bin | 10001010110000… |
… | …01101011001101 |
3 | 101010210000001200 |
4 | 20223001223031 |
5 | 244221344111 |
6 | 22234300113 |
7 | 3414462603 |
oct | 1053015315 |
9 | 333700050 |
10 | 145496781 |
11 | 75146981 |
12 | 40887639 |
13 | 241b3291 |
14 | 15475873 |
15 | cb90256 |
hex | 8ac1acd |
145496781 has 24 divisors (see below), whose sum is σ = 221382720. Its totient is φ = 91899456.
The previous prime is 145496777. The next prime is 145496801. The reversal of 145496781 is 187694541.
It is not a de Polignac number, because 145496781 - 22 = 145496777 is a prime.
It is a super-2 number, since 2×1454967812 = 42338626562723922, which contains 22 as substring.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145496381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18865 + ... + 25433.
It is an arithmetic number, because the mean of its divisors is an integer number (9224280).
Almost surely, 2145496781 is an apocalyptic number.
It is an amenable number.
145496781 is a deficient number, since it is larger than the sum of its proper divisors (75885939).
145496781 is a wasteful number, since it uses less digits than its factorization.
145496781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6705 (or 6702 counting only the distinct ones).
The product of its digits is 241920, while the sum is 45.
The square root of 145496781 is about 12062.2046492339. The cubic root of 145496781 is about 525.9580763861.
The spelling of 145496781 in words is "one hundred forty-five million, four hundred ninety-six thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •