Base | Representation |
---|---|
bin | 110101000001… |
… | …100011101111 |
3 | 222011012020101 |
4 | 311001203233 |
5 | 12024300030 |
6 | 1213531531 |
7 | 226101553 |
oct | 65014357 |
9 | 28135211 |
10 | 13900015 |
11 | 7934318 |
12 | 47a3ba7 |
13 | 2b58a7c |
14 | 1bbb863 |
15 | 13487ca |
hex | d418ef |
13900015 has 8 divisors (see below), whose sum is σ = 17035200. Its totient is φ = 10883232.
The previous prime is 13900013. The next prime is 13900043. The reversal of 13900015 is 51000931.
13900015 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 13900015 - 21 = 13900013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13899965 and 13900001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13900013) 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, 29340 + ... + 29809.
It is an arithmetic number, because the mean of its divisors is an integer number (2129400).
Almost surely, 213900015 is an apocalyptic number.
13900015 is a deficient number, since it is larger than the sum of its proper divisors (3135185).
13900015 is an equidigital number, since it uses as much as digits as its factorization.
13900015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59201.
The product of its (nonzero) digits is 135, while the sum is 19.
The square root of 13900015 is about 3728.2723881176. The cubic root of 13900015 is about 240.4390977686.
Adding to 13900015 its reverse (51000931), we get a palindrome (64900946).
The spelling of 13900015 in words is "thirteen million, nine hundred thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •