Base | Representation |
---|---|
bin | 110011111011… |
… | …100000010100 |
3 | 221121121122000 |
4 | 303323200110 |
5 | 11441104301 |
6 | 1203435300 |
7 | 223465161 |
oct | 63734024 |
9 | 27547560 |
10 | 13613076 |
11 | 7758784 |
12 | 4685b30 |
13 | 2a88299 |
14 | 1b45068 |
15 | 12dd786 |
hex | cfb814 |
13613076 has 24 divisors (see below), whose sum is σ = 35293440. Its totient is φ = 4537656.
The previous prime is 13613071. The next prime is 13613081. The reversal of 13613076 is 67031631.
13613076 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13613071) and next prime (13613081).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13613071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62916 + ... + 63131.
It is an arithmetic number, because the mean of its divisors is an integer number (1470560).
Almost surely, 213613076 is an apocalyptic number.
It is an amenable number.
13613076 is an abundant number, since it is smaller than the sum of its proper divisors (21680364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13613076 is a wasteful number, since it uses less digits than its factorization.
13613076 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126060 (or 126052 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 13613076 is about 3689.5902211492. The cubic root of 13613076 is about 238.7731138135.
It can be divided in two parts, 13 and 613076, that added together give a square (613089 = 7832).
The spelling of 13613076 in words is "thirteen million, six hundred thirteen thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •