Base | Representation |
---|---|
bin | 11010000111010100… |
… | …11100111110111000 |
3 | 1100012002022002020120 |
4 | 31003222130332320 |
5 | 212203121312440 |
6 | 10235111253240 |
7 | 1004300630061 |
oct | 150352347670 |
9 | 40162262216 |
10 | 14020104120 |
11 | 5a44a8a810 |
12 | 287337a220 |
13 | 142582a7c9 |
14 | 97002b568 |
15 | 570ca4dd0 |
hex | 343a9cfb8 |
14020104120 has 64 divisors (see below), whose sum is σ = 45883981440. Its totient is φ = 3398812800.
The previous prime is 14020104107. The next prime is 14020104139. The reversal of 14020104120 is 2140102041.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 14020104120.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5309326 + ... + 5311965.
It is an arithmetic number, because the mean of its divisors is an integer number (716937210).
Almost surely, 214020104120 is an apocalyptic number.
14020104120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14020104120 is an abundant number, since it is smaller than the sum of its proper divisors (31863877320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14020104120 is a wasteful number, since it uses less digits than its factorization.
14020104120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10621316 (or 10621312 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 14020104120 its reverse (2140102041), we get a palindrome (16160206161).
The spelling of 14020104120 in words is "fourteen billion, twenty million, one hundred four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •