Base | Representation |
---|---|
bin | 111101110011… |
… | …111010001001 |
3 | 1010111012212222 |
4 | 331303322021 |
5 | 13122002101 |
6 | 1335143425 |
7 | 254504144 |
oct | 75637211 |
9 | 33435788 |
10 | 16203401 |
11 | 9167945 |
12 | 5514b75 |
13 | 3484316 |
14 | 221b05b |
15 | 165101b |
hex | f73e89 |
16203401 has 4 divisors (see below), whose sum is σ = 16321812. Its totient is φ = 16084992.
The previous prime is 16203379. The next prime is 16203419. The reversal of 16203401 is 10430261.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7706176 + 8497225 = 2776^2 + 2915^2 .
It is a cyclic number.
It is not a de Polignac number, because 16203401 - 26 = 16203337 is a prime.
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 16203401.
It is not an unprimeable number, because it can be changed into a prime (16203101) 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, 59000 + ... + 59273.
It is an arithmetic number, because the mean of its divisors is an integer number (4080453).
Almost surely, 216203401 is an apocalyptic number.
It is an amenable number.
16203401 is a deficient number, since it is larger than the sum of its proper divisors (118411).
16203401 is a wasteful number, since it uses less digits than its factorization.
16203401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118410.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 16203401 is about 4025.3448299494. The cubic root of 16203401 is about 253.0475052311.
Adding to 16203401 its reverse (10430261), we get a palindrome (26633662).
It can be divided in two parts, 16 and 203401, that multiplied together give a square (3254416 = 18042).
The spelling of 16203401 in words is "sixteen million, two hundred three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •