Base | Representation |
---|---|
bin | 101001110010011… |
… | …0000010101111011 |
3 | 10121201101022010211 |
4 | 1103210300111323 |
5 | 10332422102443 |
6 | 351044451551 |
7 | 46514012512 |
oct | 12344602573 |
9 | 3551338124 |
10 | 1402144123 |
11 | 65a5236a6 |
12 | 3316a9bb7 |
13 | 19464c6a3 |
14 | d430d679 |
15 | 8316a19d |
hex | 5393057b |
1402144123 has 4 divisors (see below), whose sum is σ = 1402488000. Its totient is φ = 1401800248.
The previous prime is 1402144103. The next prime is 1402144141. The reversal of 1402144123 is 3214412041.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3214412041 = 31 ⋅103690711.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1402144123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1402144094 and 1402144103.
It is not an unprimeable number, because it can be changed into a prime (1402144103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 165748 + ... + 174001.
It is an arithmetic number, because the mean of its divisors is an integer number (350622000).
Almost surely, 21402144123 is an apocalyptic number.
1402144123 is a deficient number, since it is larger than the sum of its proper divisors (343877).
1402144123 is an equidigital number, since it uses as much as digits as its factorization.
1402144123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 343876.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 1402144123 is about 37445.2149546507. The cubic root of 1402144123 is about 1119.2597476122.
Adding to 1402144123 its reverse (3214412041), we get a palindrome (4616556164).
The spelling of 1402144123 in words is "one billion, four hundred two million, one hundred forty-four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •