Base | Representation |
---|---|
bin | 11010001001111100… |
… | …00001001000000000 |
3 | 1100020121112000121121 |
4 | 31010332001020000 |
5 | 212224223310422 |
6 | 10241213002024 |
7 | 1004655054664 |
oct | 150476011000 |
9 | 40217460547 |
10 | 14042010112 |
11 | 5a56392039 |
12 | 287a783314 |
13 | 142a22a630 |
14 | 972cd08a4 |
15 | 572b808c7 |
hex | 344f81200 |
14042010112 has 80 divisors (see below), whose sum is σ = 30263188032. Its totient is φ = 6470553600.
The previous prime is 14042010067. The next prime is 14042010113. The reversal of 14042010112 is 21101024041.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (14042010113) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 5503237 + ... + 5505787.
Almost surely, 214042010112 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 14042010112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15131594016).
14042010112 is an abundant number, since it is smaller than the sum of its proper divisors (16221177920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14042010112 is an equidigital number, since it uses as much as digits as its factorization.
14042010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3409 (or 3393 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 14042010112 its reverse (21101024041), we get a palindrome (35143034153).
The spelling of 14042010112 in words is "fourteen billion, forty-two million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •