Base | Representation |
---|---|
bin | 10001010011000… |
… | …10000000111101 |
3 | 101010001002120200 |
4 | 20221202000331 |
5 | 244121324312 |
6 | 22222034113 |
7 | 3411241344 |
oct | 1051420075 |
9 | 333032520 |
10 | 145104957 |
11 | 749a9558 |
12 | 40718939 |
13 | 240a6b2a |
14 | 153b2b5b |
15 | cb140dc |
hex | 8a6203d |
145104957 has 12 divisors (see below), whose sum is σ = 220627680. Its totient is φ = 91645128.
The previous prime is 145104943. The next prime is 145105007. The reversal of 145104957 is 759401541.
It is not a de Polignac number, because 145104957 - 24 = 145104941 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145104257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 424113 + ... + 424454.
It is an arithmetic number, because the mean of its divisors is an integer number (18385640).
Almost surely, 2145104957 is an apocalyptic number.
It is an amenable number.
145104957 is a deficient number, since it is larger than the sum of its proper divisors (75522723).
145104957 is a wasteful number, since it uses less digits than its factorization.
145104957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 848592 (or 848589 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 36.
The square root of 145104957 is about 12045.9518926484. The cubic root of 145104957 is about 525.4855154869.
The spelling of 145104957 in words is "one hundred forty-five million, one hundred four thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •