Base | Representation |
---|---|
bin | 110001101101… |
… | …100000010101 |
3 | 220112001210010 |
4 | 301231200111 |
5 | 11314001240 |
6 | 1143150433 |
7 | 215523360 |
oct | 61554025 |
9 | 26461703 |
10 | 13031445 |
11 | 73a0799 |
12 | 4445419 |
13 | 291361b |
14 | 1a330d7 |
15 | 1226280 |
hex | c6d815 |
13031445 has 32 divisors (see below), whose sum is σ = 24145920. Its totient is φ = 5878080.
The previous prime is 13031443. The next prime is 13031461. The reversal of 13031445 is 54413031.
It is not a de Polignac number, because 13031445 - 21 = 13031443 is a prime.
It is a super-3 number, since 3×130314453 (a number of 22 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13031441) 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 31 ways as a sum of consecutive naturals, for example, 7510 + ... + 9080.
It is an arithmetic number, because the mean of its divisors is an integer number (754560).
Almost surely, 213031445 is an apocalyptic number.
13031445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13031445 is a deficient number, since it is larger than the sum of its proper divisors (11114475).
13031445 is a wasteful number, since it uses less digits than its factorization.
13031445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1665.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 13031445 is about 3609.9092786385. The cubic root of 13031445 is about 235.3229000146.
Adding to 13031445 its reverse (54413031), we get a palindrome (67444476).
The spelling of 13031445 in words is "thirteen million, thirty-one thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •