Base | Representation |
---|---|
bin | 110010110110… |
… | …100111010111 |
3 | 221002021120011 |
4 | 302312213113 |
5 | 11403042103 |
6 | 1153421051 |
7 | 221211415 |
oct | 62664727 |
9 | 27067504 |
10 | 13330903 |
11 | 7585783 |
12 | 456a787 |
13 | 29b9a11 |
14 | 1ab02b5 |
15 | 1284d6d |
hex | cb69d7 |
13330903 has 4 divisors (see below), whose sum is σ = 13640968. Its totient is φ = 13020840.
The previous prime is 13330897. The next prime is 13330909. The reversal of 13330903 is 30903331.
13330903 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30903331 = 17 ⋅1817843.
It is an interprime number because it is at equal distance from previous prime (13330897) and next prime (13330909).
It is a cyclic number.
It is not a de Polignac number, because 13330903 - 213 = 13322711 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13330909) 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, 154968 + ... + 155053.
It is an arithmetic number, because the mean of its divisors is an integer number (3410242).
Almost surely, 213330903 is an apocalyptic number.
13330903 is a deficient number, since it is larger than the sum of its proper divisors (310065).
13330903 is an equidigital number, since it uses as much as digits as its factorization.
13330903 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310064.
The product of its (nonzero) digits is 729, while the sum is 22.
The square root of 13330903 is about 3651.1509144378. The cubic root of 13330903 is about 237.1118120299. Note that the first 3 decimals are identical.
The spelling of 13330903 in words is "thirteen million, three hundred thirty thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •