Base | Representation |
---|---|
bin | 110101110011… |
… | …001000100000 |
3 | 222112111210000 |
4 | 311303020200 |
5 | 12102244242 |
6 | 1222140000 |
7 | 230605554 |
oct | 65631040 |
9 | 28474700 |
10 | 14103072 |
11 | 7a62935 |
12 | 4881600 |
13 | 2bca319 |
14 | 1c31864 |
15 | 1388a4c |
hex | d73220 |
14103072 has 60 divisors (see below), whose sum is σ = 41484366. Its totient is φ = 4700160.
The previous prime is 14103059. The next prime is 14103091. The reversal of 14103072 is 27030141.
It can be written as a sum of positive squares in only one way, i.e., 10732176 + 3370896 = 3276^2 + 1836^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an alternating number because its digits alternate between odd and even.
It is a nialpdrome in base 16.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 129 + ... + 5312.
Almost surely, 214103072 is an apocalyptic number.
14103072 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 14103072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20742183).
14103072 is an abundant number, since it is smaller than the sum of its proper divisors (27381294).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14103072 is an equidigital number, since it uses as much as digits as its factorization.
14103072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5463 (or 5446 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 14103072 is about 3755.4057037822. The cubic root of 14103072 is about 241.6042526626.
The spelling of 14103072 in words is "fourteen million, one hundred three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •