Base | Representation |
---|---|
bin | 10111111110100… |
… | …11101111010101 |
3 | 112000111020110222 |
4 | 23333103233111 |
5 | 402443122201 |
6 | 31543124125 |
7 | 4661464310 |
oct | 1377235725 |
9 | 460436428 |
10 | 201145301 |
11 | a35a5495 |
12 | 57443645 |
13 | 328986b6 |
14 | 1c9dd977 |
15 | 129d391b |
hex | bfd3bd5 |
201145301 has 8 divisors (see below), whose sum is σ = 232113024. Its totient is φ = 170735760.
The previous prime is 201145279. The next prime is 201145361. The reversal of 201145301 is 103541102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201145301 - 222 = 196950997 is a prime.
It is a super-2 number, since 2×2011453012 = 80918864228761202, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201145301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201145361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138770 + ... + 140211.
It is an arithmetic number, because the mean of its divisors is an integer number (29014128).
Almost surely, 2201145301 is an apocalyptic number.
It is an amenable number.
201145301 is a deficient number, since it is larger than the sum of its proper divisors (30967723).
201145301 is a wasteful number, since it uses less digits than its factorization.
201145301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 279091.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 201145301 is about 14182.5703241690. The cubic root of 201145301 is about 585.9177170556.
Adding to 201145301 its reverse (103541102), we get a palindrome (304686403).
The spelling of 201145301 in words is "two hundred one million, one hundred forty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •