Base | Representation |
---|---|
bin | 10100100101001000011… |
… | …111001001010010000110 |
3 | 12000012110020101100220010 |
4 | 110211020133021102012 |
5 | 141132401123130142 |
6 | 3001411403451050 |
7 | 204114455515353 |
oct | 24451037112206 |
9 | 5005406340803 |
10 | 1414260364422 |
11 | 4a586a119134 |
12 | 1aa114b26a86 |
13 | a3497146b29 |
14 | 4c6444d962a |
15 | 26bc5072e9c |
hex | 149487c9486 |
1414260364422 has 8 divisors (see below), whose sum is σ = 2828520728856. Its totient is φ = 471420121472.
The previous prime is 1414260364421. The next prime is 1414260364459. The reversal of 1414260364422 is 2244630624141.
It is a sphenic number, since it is the product of 3 distinct primes.
1414260364422 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414260364421) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 117855030363 + ... + 117855030374.
It is an arithmetic number, because the mean of its divisors is an integer number (353565091107).
Almost surely, 21414260364422 is an apocalyptic number.
1414260364422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1414260364422 is a wasteful number, since it uses less digits than its factorization.
1414260364422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235710060742.
The product of its (nonzero) digits is 221184, while the sum is 39.
Adding to 1414260364422 its reverse (2244630624141), we get a palindrome (3658890988563).
The spelling of 1414260364422 in words is "one trillion, four hundred fourteen billion, two hundred sixty million, three hundred sixty-four thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •