Base | Representation |
---|---|
bin | 10100100111001010000… |
… | …011010101111000000100 |
3 | 12000102001201200021210200 |
4 | 110213022003111320010 |
5 | 141201324113122202 |
6 | 3002411214450500 |
7 | 204222362214006 |
oct | 24471203257004 |
9 | 5012051607720 |
10 | 1416434114052 |
11 | 4a6785149431 |
12 | 1aa620b03a30 |
13 | a37525b7109 |
14 | 4c7ad0a2376 |
15 | 26ca0d06e1c |
hex | 149ca0d5e04 |
1416434114052 has 72 divisors (see below), whose sum is σ = 3590195883456. Its totient is φ = 470857489344.
The previous prime is 1416434114047. The next prime is 1416434114089. The reversal of 1416434114052 is 2504114346141.
1416434114052 is a `hidden beast` number, since 1 + 4 + 1 + 643 + 4 + 1 + 1 + 4 + 0 + 5 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 1416434113998 and 1416434114016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 109227273 + ... + 109240239.
Almost surely, 21416434114052 is an apocalyptic number.
1416434114052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1416434114052 is an abundant number, since it is smaller than the sum of its proper divisors (2173761769404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1416434114052 is a wasteful number, since it uses less digits than its factorization.
1416434114052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21017 (or 21012 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
The spelling of 1416434114052 in words is "one trillion, four hundred sixteen billion, four hundred thirty-four million, one hundred fourteen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •