Base | Representation |
---|---|
bin | 10001010010011… |
… | …00000110100001 |
3 | 101002212112110101 |
4 | 20221030012201 |
5 | 244110441301 |
6 | 22220102401 |
7 | 3410415562 |
oct | 1051140641 |
9 | 332775411 |
10 | 145015201 |
11 | 74948081 |
12 | 40694a01 |
13 | 24075016 |
14 | 1538c169 |
15 | cae7701 |
hex | 8a4c1a1 |
145015201 has 4 divisors (see below), whose sum is σ = 152647600. Its totient is φ = 137382804.
The previous prime is 145015187. The next prime is 145015217. The reversal of 145015201 is 102510541.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 145015201 - 211 = 145013153 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19), and also a Moran number because the ratio is a prime number: 7632379 = 145015201 / (1 + 4 + 5 + 0 + 1 + 5 + 2 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145015271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3816171 + ... + 3816208.
It is an arithmetic number, because the mean of its divisors is an integer number (38161900).
Almost surely, 2145015201 is an apocalyptic number.
It is an amenable number.
145015201 is a deficient number, since it is larger than the sum of its proper divisors (7632399).
145015201 is an equidigital number, since it uses as much as digits as its factorization.
145015201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7632398.
The product of its (nonzero) digits is 200, while the sum is 19.
The square root of 145015201 is about 12042.2257494202. The cubic root of 145015201 is about 525.3771451800.
Adding to 145015201 its reverse (102510541), we get a palindrome (247525742).
The spelling of 145015201 in words is "one hundred forty-five million, fifteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •