Base | Representation |
---|---|
bin | 110100001110… |
… | …010100101000 |
3 | 221202112100200 |
4 | 310032110220 |
5 | 12001041102 |
6 | 1205232200 |
7 | 224235660 |
oct | 64162450 |
9 | 27675320 |
10 | 13690152 |
11 | 7800683 |
12 | 4702660 |
13 | 2ab43a8 |
14 | 1b651a0 |
15 | 130651c |
hex | d0e528 |
13690152 has 96 divisors (see below), whose sum is σ = 44254080. Its totient is φ = 3738240.
The previous prime is 13690141. The next prime is 13690153. The reversal of 13690152 is 25109631.
It is not an unprimeable number, because it can be changed into a prime (13690153) 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, 11002 + ... + 12182.
It is an arithmetic number, because the mean of its divisors is an integer number (460980).
Almost surely, 213690152 is an apocalyptic number.
13690152 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 13690152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22127040).
13690152 is an abundant number, since it is smaller than the sum of its proper divisors (30563928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13690152 is a wasteful number, since it uses less digits than its factorization.
13690152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1223 (or 1216 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 13690152 is about 3700.0205404835. The cubic root of 13690152 is about 239.2229032182. Note that the first 3 decimals are identical.
Adding to 13690152 its reverse (25109631), we get a palindrome (38799783).
The spelling of 13690152 in words is "thirteen million, six hundred ninety thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •