Base | Representation |
---|---|
bin | 110100101010… |
… | …000011100110 |
3 | 221222022012000 |
4 | 310222003212 |
5 | 12013210000 |
6 | 1211510130 |
7 | 225221112 |
oct | 64520346 |
9 | 27868160 |
10 | 13803750 |
11 | 7878a64 |
12 | 4758346 |
13 | 2b23ccc |
14 | 1b94742 |
15 | 132a000 |
hex | d2a0e6 |
13803750 has 80 divisors (see below), whose sum is σ = 38425200. Its totient is φ = 3672000.
The previous prime is 13803743. The next prime is 13803793. The reversal of 13803750 is 5730831.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
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 39 ways as a sum of consecutive naturals, for example, 33546 + ... + 33954.
It is an arithmetic number, because the mean of its divisors is an integer number (480315).
Almost surely, 213803750 is an apocalyptic number.
13803750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13803750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19212600).
13803750 is an abundant number, since it is smaller than the sum of its proper divisors (24621450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13803750 is an equidigital number, since it uses as much as digits as its factorization.
13803750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440 (or 419 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 13803750 is about 3715.3398229503. The cubic root of 13803750 is about 239.8827552329.
The spelling of 13803750 in words is "thirteen million, eight hundred three thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •