Base | Representation |
---|---|
bin | 110010001000… |
… | …010101000000 |
3 | 220201122111021 |
4 | 302020111000 |
5 | 11331010222 |
6 | 1145355224 |
7 | 216461602 |
oct | 62102500 |
9 | 26648437 |
10 | 13141312 |
11 | 7466298 |
12 | 4498b14 |
13 | 2951632 |
14 | 1a61172 |
15 | 1248ac7 |
hex | c88540 |
13141312 has 56 divisors (see below), whose sum is σ = 27980640. Its totient is φ = 6105600.
The previous prime is 13141309. The next prime is 13141351. The reversal of 13141312 is 21314131.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a nialpdrome in base 16.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 122763 + ... + 122869.
Almost surely, 213141312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13141312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13990320).
13141312 is an abundant number, since it is smaller than the sum of its proper divisors (14839328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13141312 is a wasteful number, since it uses less digits than its factorization.
13141312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239 (or 229 counting only the distinct ones).
The product of its digits is 72, while the sum is 16.
The square root of 13141312 is about 3625.0947573822. The cubic root of 13141312 is about 235.9823792264.
Adding to 13141312 its reverse (21314131), we get a palindrome (34455443).
It can be divided in two parts, 1314131 and 2, that multiplied together give a palindrome (2628262).
The spelling of 13141312 in words is "thirteen million, one hundred forty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •