Base | Representation |
---|---|
bin | 110100110100… |
… | …001000100111 |
3 | 222001101210221 |
4 | 310310020213 |
5 | 12021020111 |
6 | 1212425211 |
7 | 225452344 |
oct | 64641047 |
9 | 28041727 |
10 | 13845031 |
11 | 78a6a82 |
12 | 4778207 |
13 | 2b39a35 |
14 | 1ba57cb |
15 | 1337371 |
hex | d34227 |
13845031 has 8 divisors (see below), whose sum is σ = 14178240. Its totient is φ = 13514592.
The previous prime is 13845023. The next prime is 13845047. The reversal of 13845031 is 13054831.
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 13845031 - 23 = 13845023 is a prime.
It is a super-2 number, since 2×138450312 = 383369766781922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13844987 and 13845005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13845001) 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 7 ways as a sum of consecutive naturals, for example, 12121 + ... + 13213.
It is an arithmetic number, because the mean of its divisors is an integer number (1772280).
Almost surely, 213845031 is an apocalyptic number.
13845031 is a deficient number, since it is larger than the sum of its proper divisors (333209).
13845031 is a wasteful number, since it uses less digits than its factorization.
13845031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1385.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 13845031 is about 3720.8911566989. The cubic root of 13845031 is about 240.1216455087.
Adding to 13845031 its reverse (13054831), we get a palindrome (26899862).
The spelling of 13845031 in words is "thirteen million, eight hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •