Base | Representation |
---|---|
bin | 10101010000110001000… |
… | …011010000111011111111 |
3 | 12011200101101122220120202 |
4 | 111100301003100323333 |
5 | 142414324111220111 |
6 | 3035120413034115 |
7 | 210363466360403 |
oct | 25206103207377 |
9 | 5150341586522 |
10 | 1461111820031 |
11 | 513721593186 |
12 | 1b720b48593b |
13 | a7a227c2b26 |
14 | 50a0a9d7103 |
15 | 280182d0b3b |
hex | 154310d0eff |
1461111820031 has 2 divisors, whose sum is σ = 1461111820032. Its totient is φ = 1461111820030.
The previous prime is 1461111820009. The next prime is 1461111820043. The reversal of 1461111820031 is 1300281111641.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1461111820031 - 218 = 1461111557887 is a prime.
It is a super-2 number, since 2×14611118200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1461111819976 and 1461111820003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1461111820001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 730555910015 + 730555910016.
It is an arithmetic number, because the mean of its divisors is an integer number (730555910016).
Almost surely, 21461111820031 is an apocalyptic number.
1461111820031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1461111820031 is an equidigital number, since it uses as much as digits as its factorization.
1461111820031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 29.
Adding to 1461111820031 its reverse (1300281111641), we get a palindrome (2761392931672).
The spelling of 1461111820031 in words is "one trillion, four hundred sixty-one billion, one hundred eleven million, eight hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •