Base | Representation |
---|---|
bin | 110100101110… |
… | …000111010001 |
3 | 222000010222112 |
4 | 310232013101 |
5 | 12014222434 |
6 | 1212115105 |
7 | 225320423 |
oct | 64560721 |
9 | 28003875 |
10 | 13820369 |
11 | 788a4a2 |
12 | 4765a95 |
13 | 2b2b744 |
14 | 1b9a813 |
15 | 132edce |
hex | d2e1d1 |
13820369 has 4 divisors (see below), whose sum is σ = 13926000. Its totient is φ = 13714740.
The previous prime is 13820299. The next prime is 13820381. The reversal of 13820369 is 96302831.
13820369 is digitally balanced in base 2, 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 a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 96302831 = 271 ⋅355361.
It is a cyclic number.
It is not a de Polignac number, because 13820369 - 28 = 13820113 is a prime.
It is a super-2 number, since 2×138203692 = 382005198592322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13820399) 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, 52619 + ... + 52880.
It is an arithmetic number, because the mean of its divisors is an integer number (3481500).
Almost surely, 213820369 is an apocalyptic number.
It is an amenable number.
13820369 is a deficient number, since it is larger than the sum of its proper divisors (105631).
13820369 is a wasteful number, since it uses less digits than its factorization.
13820369 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105630.
The product of its (nonzero) digits is 7776, while the sum is 32.
The square root of 13820369 is about 3717.5756885368. The cubic root of 13820369 is about 239.9789854285.
The spelling of 13820369 in words is "thirteen million, eight hundred twenty thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •