Base | Representation |
---|---|
bin | 101110010001… |
… | …100100110101 |
3 | 211211022001222 |
4 | 232101210311 |
5 | 11101134423 |
6 | 1112000125 |
7 | 205052135 |
oct | 56214465 |
9 | 24738058 |
10 | 12130613 |
11 | 6935a00 |
12 | 4090045 |
13 | 26895a1 |
14 | 187aac5 |
15 | 10e93c8 |
hex | b91935 |
12130613 has 12 divisors (see below), whose sum is σ = 13797420. Its totient is φ = 10644480.
The previous prime is 12130609. The next prime is 12130621. The reversal of 12130613 is 31603121.
12130613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 2439844 + 9690769 = 1562^2 + 3113^2 .
It is not a de Polignac number, because 12130613 - 22 = 12130609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12130591 and 12130600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12132613) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1781 + ... + 5237.
It is an arithmetic number, because the mean of its divisors is an integer number (1149785).
Almost surely, 212130613 is an apocalyptic number.
It is an amenable number.
12130613 is a deficient number, since it is larger than the sum of its proper divisors (1666807).
12130613 is a wasteful number, since it uses less digits than its factorization.
12130613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3508 (or 3497 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 12130613 is about 3482.9029558689. The cubic root of 12130613 is about 229.7704893904.
Adding to 12130613 its reverse (31603121), we get a palindrome (43733734).
The spelling of 12130613 in words is "twelve million, one hundred thirty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •