Base | Representation |
---|---|
bin | 101111111010001011110001… |
… | …0010111100001110010000011 |
3 | 2001021002200212210012121002121 |
4 | 1133310113202113201302003 |
5 | 420213413014111001011 |
6 | 4052134301332025111 |
7 | 154523043365534305 |
oct | 13764274227416203 |
9 | 2037080783177077 |
10 | 421413104000131 |
11 | 112303325a9a1a1 |
12 | 3b320823a62197 |
13 | 1511b115221789 |
14 | 760c70858d975 |
15 | 33abdc676ae71 |
hex | 17f45e25e1c83 |
421413104000131 has 2 divisors, whose sum is σ = 421413104000132. Its totient is φ = 421413104000130.
The previous prime is 421413104000039. The next prime is 421413104000143. The reversal of 421413104000131 is 131000401314124.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 421413104000131 - 219 = 421413103475843 is a prime.
It is a super-2 number, since 2×4214131040001312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 421413104000096 and 421413104000105.
It is not a weakly prime, because it can be changed into another prime (421413104007131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210706552000065 + 210706552000066.
It is an arithmetic number, because the mean of its divisors is an integer number (210706552000066).
Almost surely, 2421413104000131 is an apocalyptic number.
421413104000131 is a deficient number, since it is larger than the sum of its proper divisors (1).
421413104000131 is an equidigital number, since it uses as much as digits as its factorization.
421413104000131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 421413104000131 its reverse (131000401314124), we get a palindrome (552413505314255).
The spelling of 421413104000131 in words is "four hundred twenty-one trillion, four hundred thirteen billion, one hundred four million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •