Base | Representation |
---|---|
bin | 11000000000101… |
… | …01100101110111 |
3 | 112000222221110222 |
4 | 30000111211313 |
5 | 403030240111 |
6 | 31553004555 |
7 | 4663666556 |
oct | 1400254567 |
9 | 460887428 |
10 | 201415031 |
11 | a376a104 |
12 | 5755375b |
13 | 329613bc |
14 | 1ca6dd9d |
15 | 12a387db |
hex | c015977 |
201415031 has 8 divisors (see below), whose sum is σ = 214799760. Its totient is φ = 188201088.
The previous prime is 201415009. The next prime is 201415033. The reversal of 201415031 is 130514102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201415031 is a prime.
It is a super-2 number, since 2×2014150312 = 81136029425461922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201415033) 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 7 ways as a sum of consecutive naturals, for example, 40256 + ... + 44981.
It is an arithmetic number, because the mean of its divisors is an integer number (26849970).
Almost surely, 2201415031 is an apocalyptic number.
201415031 is a deficient number, since it is larger than the sum of its proper divisors (13384729).
201415031 is a wasteful number, since it uses less digits than its factorization.
201415031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85393.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 201415031 is about 14192.0763456233. The cubic root of 201415031 is about 586.1794996168.
Adding to 201415031 its reverse (130514102), we get a palindrome (331929133).
The spelling of 201415031 in words is "two hundred one million, four hundred fifteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •