Base | Representation |
---|---|
bin | 101001111000001… |
… | …1111000101000011 |
3 | 10121221011112021022 |
4 | 1103300133011003 |
5 | 10334214003024 |
6 | 351234420055 |
7 | 46552110542 |
oct | 12360370503 |
9 | 3557145238 |
10 | 1405219139 |
11 | 661233a35 |
12 | 33273162b |
13 | 19518821c |
14 | d48b0159 |
15 | 8357635e |
hex | 53c1f143 |
1405219139 has 2 divisors, whose sum is σ = 1405219140. Its totient is φ = 1405219138.
The previous prime is 1405219129. The next prime is 1405219141. The reversal of 1405219139 is 9319125041.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (9319125041) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1405219139 is a prime.
It is a super-2 number, since 2×14052191392 = 3949281657223802642, which contains 22 as substring.
Together with 1405219141, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1405219099 and 1405219108.
It is not a weakly prime, because it can be changed into another prime (1405219129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 702609569 + 702609570.
It is an arithmetic number, because the mean of its divisors is an integer number (702609570).
Almost surely, 21405219139 is an apocalyptic number.
1405219139 is a deficient number, since it is larger than the sum of its proper divisors (1).
1405219139 is an equidigital number, since it uses as much as digits as its factorization.
1405219139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 35.
The square root of 1405219139 is about 37486.2526668111. The cubic root of 1405219139 is about 1120.0773593994.
The spelling of 1405219139 in words is "one billion, four hundred five million, two hundred nineteen thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •