Base | Representation |
---|---|
bin | 10100011010000110110… |
… | …111011011000001000110 |
3 | 11222001220012102212002220 |
4 | 110122012313123001012 |
5 | 140434130013422042 |
6 | 2552132550513210 |
7 | 203215216301301 |
oct | 24320667330106 |
9 | 4861805385086 |
10 | 1402422014022 |
11 | 4a0844736277 |
12 | 1a7970365806 |
13 | a232b62c873 |
14 | 4bc40159b38 |
15 | 26730ad38ec |
hex | 14686ddb046 |
1402422014022 has 8 divisors (see below), whose sum is σ = 2804844028056. Its totient is φ = 467474004672.
The previous prime is 1402422014011. The next prime is 1402422014051. The reversal of 1402422014022 is 2204102242041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1402422014022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1402422013983 and 1402422014001.
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 3 ways as a sum of consecutive naturals, for example, 116868501163 + ... + 116868501174.
It is an arithmetic number, because the mean of its divisors is an integer number (350605503507).
Almost surely, 21402422014022 is an apocalyptic number.
1402422014022 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.
1402422014022 is a wasteful number, since it uses less digits than its factorization.
1402422014022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233737002342.
The product of its (nonzero) digits is 2048, while the sum is 24.
Adding to 1402422014022 its reverse (2204102242041), we get a palindrome (3606524256063).
The spelling of 1402422014022 in words is "one trillion, four hundred two billion, four hundred twenty-two million, fourteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •