Base | Representation |
---|---|
bin | 101001110010000… |
… | …1111110110001011 |
3 | 10121201010112120001 |
4 | 1103210033312023 |
5 | 10332403323034 |
6 | 351041543431 |
7 | 46512616453 |
oct | 12344176613 |
9 | 3551115501 |
10 | 1402011019 |
11 | 65a4426a2 |
12 | 331644b77 |
13 | 194603c26 |
14 | d42b6d63 |
15 | 83140a14 |
hex | 5390fd8b |
1402011019 has 2 divisors, whose sum is σ = 1402011020. Its totient is φ = 1402011018.
The previous prime is 1402011011. The next prime is 1402011043. The reversal of 1402011019 is 9101102041.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1402011019 - 23 = 1402011011 is a prime.
It is a super-2 number, since 2×14020110192 = 3931269794794836722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1402010987 and 1402011005.
It is not a weakly prime, because it can be changed into another prime (1402011011) 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 as a sum of consecutive naturals, namely, 701005509 + 701005510.
It is an arithmetic number, because the mean of its divisors is an integer number (701005510).
Almost surely, 21402011019 is an apocalyptic number.
1402011019 is a deficient number, since it is larger than the sum of its proper divisors (1).
1402011019 is an equidigital number, since it uses as much as digits as its factorization.
1402011019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
The square root of 1402011019 is about 37443.4375959259. The cubic root of 1402011019 is about 1119.2243297924.
The spelling of 1402011019 in words is "one billion, four hundred two million, eleven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •