Base | Representation |
---|---|
bin | 110100001001… |
… | …101001101100 |
3 | 221201120010002 |
4 | 310021221230 |
5 | 11444433040 |
6 | 1205003432 |
7 | 224126126 |
oct | 64115154 |
9 | 27646102 |
10 | 13671020 |
11 | 7798270 |
12 | 46b3578 |
13 | 2aa877c |
14 | 1b5c216 |
15 | 1300a15 |
hex | d09a6c |
13671020 has 24 divisors (see below), whose sum is σ = 31319568. Its totient is φ = 4971200.
The previous prime is 13671011. The next prime is 13671041. The reversal of 13671020 is 2017631.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 13670983 and 13671001.
It is an unprimeable number.
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, 30851 + ... + 31290.
It is an arithmetic number, because the mean of its divisors is an integer number (1304982).
Almost surely, 213671020 is an apocalyptic number.
13671020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13671020 is an abundant number, since it is smaller than the sum of its proper divisors (17648548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13671020 is a wasteful number, since it uses less digits than its factorization.
13671020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62161 (or 62159 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 20.
The square root of 13671020 is about 3697.4342455276. The cubic root of 13671020 is about 239.1114131905. Note that the first 3 decimals are identical.
Adding to 13671020 its reverse (2017631), we get a palindrome (15688651).
The spelling of 13671020 in words is "thirteen million, six hundred seventy-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •