Base | Representation |
---|---|
bin | 110000011100… |
… | …110111110100 |
3 | 212220021201210 |
4 | 300130313310 |
5 | 11222414142 |
6 | 1132121420 |
7 | 212646441 |
oct | 60346764 |
9 | 25807653 |
10 | 12701172 |
11 | 7195640 |
12 | 4306270 |
13 | 28291b3 |
14 | 19889c8 |
15 | 11ad49c |
hex | c1cdf4 |
12701172 has 24 divisors (see below), whose sum is σ = 32330592. Its totient is φ = 3848800.
The previous prime is 12701167. The next prime is 12701191. The reversal of 12701172 is 27110721.
It is a happy number.
It is a super-2 number, since 2×127011722 = 322639540347168, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 47979 + ... + 48242.
It is an arithmetic number, because the mean of its divisors is an integer number (1347108).
Almost surely, 212701172 is an apocalyptic number.
12701172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12701172 is an abundant number, since it is smaller than the sum of its proper divisors (19629420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12701172 is a wasteful number, since it uses less digits than its factorization.
12701172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96239 (or 96237 counting only the distinct ones).
The product of its (nonzero) digits is 196, while the sum is 21.
The square root of 12701172 is about 3563.8703680128. The cubic root of 12701172 is about 233.3178320768.
Adding to 12701172 its reverse (27110721), we get a palindrome (39811893).
It can be divided in two parts, 1270 and 1172, that added together give a palindrome (2442).
The spelling of 12701172 in words is "twelve million, seven hundred one thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •