Base | Representation |
---|---|
bin | 11010000110101001… |
… | …01110000001010000 |
3 | 1100011200120121220100 |
4 | 31003110232001100 |
5 | 212200142003421 |
6 | 10234345212400 |
7 | 1004201330451 |
oct | 150324560120 |
9 | 40150517810 |
10 | 14014406736 |
11 | 5a41849230 |
12 | 2871491100 |
13 | 14245b4485 |
14 | 96d387128 |
15 | 57052bc26 |
hex | 34352e050 |
14014406736 has 120 divisors (see below), whose sum is σ = 44646803136. Its totient is φ = 4062136320.
The previous prime is 14014406723. The next prime is 14014406741. The reversal of 14014406736 is 63760441041.
14014406736 is a `hidden beast` number, since 140 + 1 + 440 + 6 + 73 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 14014406736.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 155905 + ... + 228768.
Almost surely, 214014406736 is an apocalyptic number.
14014406736 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
14014406736 is an abundant number, since it is smaller than the sum of its proper divisors (30632396400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14014406736 is a wasteful number, since it uses less digits than its factorization.
14014406736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384721 (or 384712 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
Adding to 14014406736 its reverse (63760441041), we get a palindrome (77774847777).
The spelling of 14014406736 in words is "fourteen billion, fourteen million, four hundred six thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •