Base | Representation |
---|---|
bin | 110101000001… |
… | …110100111000 |
3 | 222011020202000 |
4 | 311001310320 |
5 | 12024313422 |
6 | 1213541000 |
7 | 226105011 |
oct | 65016470 |
9 | 28136660 |
10 | 13901112 |
11 | 7935125 |
12 | 47a4760 |
13 | 2b59414 |
14 | 1bbc008 |
15 | 1348cac |
hex | d41d38 |
13901112 has 64 divisors (see below), whose sum is σ = 38976000. Its totient is φ = 4590432.
The previous prime is 13901071. The next prime is 13901123. The reversal of 13901112 is 21110931.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29793 + ... + 30255.
It is an arithmetic number, because the mean of its divisors is an integer number (609000).
Almost surely, 213901112 is an apocalyptic number.
13901112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13901112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19488000).
13901112 is an abundant number, since it is smaller than the sum of its proper divisors (25074888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13901112 is a wasteful number, since it uses less digits than its factorization.
13901112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617 (or 607 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
The square root of 13901112 is about 3728.4195042940. The cubic root of 13901112 is about 240.4454228157.
The spelling of 13901112 in words is "thirteen million, nine hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •