Base | Representation |
---|---|
bin | 11010001001111101… |
… | …11100111101100000 |
3 | 1100020121222110210221 |
4 | 31010332330331200 |
5 | 212224304131300 |
6 | 10241222132424 |
7 | 1004660125351 |
oct | 150476747540 |
9 | 40217873727 |
10 | 14042255200 |
11 | 5a5653a196 |
12 | 287a881114 |
13 | 142a2b505c |
14 | 972d55d28 |
15 | 572bcd31a |
hex | 344fbcf60 |
14042255200 has 36 divisors (see below), whose sum is σ = 34280657460. Its totient is φ = 5616901760.
The previous prime is 14042255177. The next prime is 14042255231. The reversal of 14042255200 is 255224041.
It is a super-2 number, since 2×140422552002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
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 5 ways as a sum of consecutive naturals, for example, 8775610 + ... + 8777209.
It is an arithmetic number, because the mean of its divisors is an integer number (952240485).
Almost surely, 214042255200 is an apocalyptic number.
14042255200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14042255200 is an abundant number, since it is smaller than the sum of its proper divisors (20238402260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14042255200 is a wasteful number, since it uses less digits than its factorization.
14042255200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17552839 (or 17552826 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 25.
Adding to 14042255200 its reverse (255224041), we get a palindrome (14297479241).
The spelling of 14042255200 in words is "fourteen billion, forty-two million, two hundred fifty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •