Base | Representation |
---|---|
bin | 10001010100100… |
… | …10001001010101 |
3 | 101010102010000022 |
4 | 20222102021111 |
5 | 244144131401 |
6 | 22230154525 |
7 | 3413022200 |
oct | 1052221125 |
9 | 333363008 |
10 | 145302101 |
11 | 7502368a |
12 | 407b2a45 |
13 | 24145799 |
14 | 15424937 |
15 | cb5271b |
hex | 8a92255 |
145302101 has 12 divisors (see below), whose sum is σ = 177922080. Its totient is φ = 117988920.
The previous prime is 145302089. The next prime is 145302127. The reversal of 145302101 is 101203541.
It is not a de Polignac number, because 145302101 - 210 = 145301077 is a prime.
It is a super-2 number, since 2×1453021012 = 42225401110028402, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 145302101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145302161) 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, 77105 + ... + 78966.
It is an arithmetic number, because the mean of its divisors is an integer number (14826840).
Almost surely, 2145302101 is an apocalyptic number.
It is an amenable number.
145302101 is a deficient number, since it is larger than the sum of its proper divisors (32619979).
145302101 is a wasteful number, since it uses less digits than its factorization.
145302101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156104 (or 156097 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 145302101 is about 12054.1321130972. The cubic root of 145302101 is about 525.7233879842.
Adding to 145302101 its reverse (101203541), we get a palindrome (246505642).
The spelling of 145302101 in words is "one hundred forty-five million, three hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •