Base | Representation |
---|---|
bin | 11010001010000000… |
… | …01111101101110000 |
3 | 1100020122121200210000 |
4 | 31011000033231300 |
5 | 212224401003120 |
6 | 10241233310000 |
7 | 1004663036520 |
oct | 150500175560 |
9 | 40218550700 |
10 | 14042594160 |
11 | 5a56750921 |
12 | 287aa05300 |
13 | 142a3a341a |
14 | 973003680 |
15 | 572c48990 |
hex | 34500fb70 |
14042594160 has 400 divisors, whose sum is σ = 55961078976. Its totient is φ = 3196993536.
The previous prime is 14042594149. The next prime is 14042594191. The reversal of 14042594160 is 6149524041.
14042594160 is a `hidden beast` number, since 1 + 4 + 0 + 4 + 2 + 594 + 1 + 60 = 666.
It is a super-2 number, since 2×140425941602 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 16011642 + ... + 16012518.
Almost surely, 214042594160 is an apocalyptic number.
14042594160 is a gapful number since it is divisible by the number (10) 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 14042594160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27980539488).
14042594160 is an abundant number, since it is smaller than the sum of its proper divisors (41918484816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14042594160 is a wasteful number, since it uses less digits than its factorization.
14042594160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1262 (or 1247 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The spelling of 14042594160 in words is "fourteen billion, forty-two million, five hundred ninety-four thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •