Base | Representation |
---|---|
bin | 110101000001… |
… | …011000111001 |
3 | 222011011021200 |
4 | 311001120321 |
5 | 12024234241 |
6 | 1213524413 |
7 | 226066542 |
oct | 65013071 |
9 | 28134250 |
10 | 13899321 |
11 | 7933847 |
12 | 47a3709 |
13 | 2b58667 |
14 | 1bbb4c9 |
15 | 13484b6 |
hex | d41639 |
13899321 has 12 divisors (see below), whose sum is σ = 20125872. Its totient is φ = 9243576.
The previous prime is 13899311. The next prime is 13899329. The reversal of 13899321 is 12399831.
13899321 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13899321 - 25 = 13899289 is a prime.
It is a super-2 number, since 2×138993212 = 386382248522082, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (13899329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2550 + ... + 5856.
It is an arithmetic number, because the mean of its divisors is an integer number (1677156).
Almost surely, 213899321 is an apocalyptic number.
It is an amenable number.
13899321 is a deficient number, since it is larger than the sum of its proper divisors (6226551).
13899321 is a wasteful number, since it uses less digits than its factorization.
13899321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3780 (or 3777 counting only the distinct ones).
The product of its digits is 11664, while the sum is 36.
The square root of 13899321 is about 3728.1793143571. The cubic root of 13899321 is about 240.4350961539.
The spelling of 13899321 in words is "thirteen million, eight hundred ninety-nine thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •