Base | Representation |
---|---|
bin | 110101001000… |
… | …010100001100 |
3 | 222012121012110 |
4 | 311020110030 |
5 | 12031141232 |
6 | 1214304020 |
7 | 226245342 |
oct | 65102414 |
9 | 28177173 |
10 | 13927692 |
11 | 7953099 |
12 | 47b8010 |
13 | 2b6854c |
14 | 1bc7992 |
15 | 1351acc |
hex | d4850c |
13927692 has 48 divisors (see below), whose sum is σ = 34957440. Its totient is φ = 4300032.
The previous prime is 13927687. The next prime is 13927721. The reversal of 13927692 is 29672931.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 13927692.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13159 + ... + 14177.
It is an arithmetic number, because the mean of its divisors is an integer number (728280).
Almost surely, 213927692 is an apocalyptic number.
13927692 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 13927692, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17478720).
13927692 is an abundant number, since it is smaller than the sum of its proper divisors (21029748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13927692 is a wasteful number, since it uses less digits than its factorization.
13927692 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1110 (or 1108 counting only the distinct ones).
The product of its digits is 40824, while the sum is 39.
The square root of 13927692 is about 3731.9823150706. The cubic root of 13927692 is about 240.5985753183.
The spelling of 13927692 in words is "thirteen million, nine hundred twenty-seven thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •