Base | Representation |
---|---|
bin | 110110000001… |
… | …101101111000 |
3 | 222122112201110 |
4 | 312001231320 |
5 | 12111202213 |
6 | 1223320320 |
7 | 231244662 |
oct | 66015570 |
9 | 28575643 |
10 | 14162808 |
11 | 7aa3800 |
12 | 48b00a0 |
13 | 2c1b57a |
14 | 1c49532 |
15 | 139b5c3 |
hex | d81b78 |
14162808 has 48 divisors (see below), whose sum is σ = 38926440. Its totient is φ = 4290880.
The previous prime is 14162801. The next prime is 14162821. The reversal of 14162808 is 80826141.
14162808 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14162801) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 466 + ... + 5342.
Almost surely, 214162808 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14162808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19463220).
14162808 is an abundant number, since it is smaller than the sum of its proper divisors (24763632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14162808 is a wasteful number, since it uses less digits than its factorization.
14162808 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4908 (or 4893 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 30.
The square root of 14162808 is about 3763.3506347403. The cubic root of 14162808 is about 241.9448910326.
Adding to 14162808 its reverse (80826141), we get a palindrome (94988949).
It can be divided in two parts, 1416 and 2808, that added together give a palindrome (4224).
The spelling of 14162808 in words is "fourteen million, one hundred sixty-two thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •