Base | Representation |
---|---|
bin | 101110110110… |
… | …011101101010 |
3 | 212002222100000 |
4 | 232312131222 |
5 | 11121003311 |
6 | 1115123430 |
7 | 206251503 |
oct | 56663552 |
9 | 25088300 |
10 | 12281706 |
11 | 6a29478 |
12 | 4143576 |
13 | 27102a8 |
14 | 18b9baa |
15 | 1129056 |
hex | bb676a |
12281706 has 48 divisors (see below), whose sum is σ = 28383264. Its totient is φ = 3977424.
The previous prime is 12281693. The next prime is 12281707. The reversal of 12281706 is 60718221.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 12281706.
It is not an unprimeable number, because it can be changed into a prime (12281707) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17641 + ... + 18323.
It is an arithmetic number, because the mean of its divisors is an integer number (591318).
Almost surely, 212281706 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12281706, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14191632).
12281706 is an abundant number, since it is smaller than the sum of its proper divisors (16101558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12281706 is an equidigital number, since it uses as much as digits as its factorization.
12281706 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737 (or 725 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 12281706 is about 3504.5265015405. The cubic root of 12281706 is about 230.7205255674.
Adding to 12281706 its reverse (60718221), we get a palindrome (72999927).
The spelling of 12281706 in words is "twelve million, two hundred eighty-one thousand, seven hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •