Base | Representation |
---|---|
bin | 101111010110… |
… | …100110001010 |
3 | 212100122212200 |
4 | 233112212022 |
5 | 11134211242 |
6 | 1122021030 |
7 | 210340305 |
oct | 57264612 |
9 | 25318780 |
10 | 12413322 |
11 | 7009349 |
12 | 41a7776 |
13 | 275817c |
14 | 1911b3c |
15 | 115304c |
hex | bd698a |
12413322 has 12 divisors (see below), whose sum is σ = 26895570. Its totient is φ = 4137768.
The previous prime is 12413321. The next prime is 12413329. The reversal of 12413322 is 22331421.
It can be written as a sum of positive squares in only one way, i.e., 6610041 + 5803281 = 2571^2 + 2409^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 689629 = 12413322 / (1 + 2 + 4 + 1 + 3 + 3 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 12413295 and 12413304.
It is not an unprimeable number, because it can be changed into a prime (12413321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 344797 + ... + 344832.
Almost surely, 212413322 is an apocalyptic number.
12413322 is an abundant number, since it is smaller than the sum of its proper divisors (14482248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12413322 is a wasteful number, since it uses less digits than its factorization.
12413322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689637 (or 689634 counting only the distinct ones).
The product of its digits is 288, while the sum is 18.
The square root of 12413322 is about 3523.2544614319. The cubic root of 12413322 is about 231.5417654510.
Adding to 12413322 its reverse (22331421), we get a palindrome (34744743).
The spelling of 12413322 in words is "twelve million, four hundred thirteen thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •