Base | Representation |
---|---|
bin | 10100011100101000111… |
… | …011100101001010001011 |
3 | 11222022220200201022200121 |
4 | 110130220323211022023 |
5 | 141010212044410011 |
6 | 2553302440244111 |
7 | 203342463354352 |
oct | 24345073451213 |
9 | 4868820638617 |
10 | 1405141013131 |
11 | 4a1a0a519579 |
12 | 1a83aaa70637 |
13 | a2672a38c8b |
14 | 4c01b2d6999 |
15 | 2683e66ce71 |
hex | 14728ee528b |
1405141013131 has 2 divisors, whose sum is σ = 1405141013132. Its totient is φ = 1405141013130.
The previous prime is 1405141013113. The next prime is 1405141013141. The reversal of 1405141013131 is 1313101415041.
Together with previous prime (1405141013113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1405141013131 - 29 = 1405141012619 is a prime.
It is a super-2 number, since 2×14051410131312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1405141013096 and 1405141013105.
It is not a weakly prime, because it can be changed into another prime (1405141013141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 702570506565 + 702570506566.
It is an arithmetic number, because the mean of its divisors is an integer number (702570506566).
Almost surely, 21405141013131 is an apocalyptic number.
1405141013131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1405141013131 is an equidigital number, since it uses as much as digits as its factorization.
1405141013131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 1405141013131 its reverse (1313101415041), we get a palindrome (2718242428172).
The spelling of 1405141013131 in words is "one trillion, four hundred five billion, one hundred forty-one million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •