Base | Representation |
---|---|
bin | 1100001100101001100000… |
… | …1011011011110100001111 |
3 | 1202111010021101101120022101 |
4 | 3003022120023123310033 |
5 | 3224213112401014323 |
6 | 44305044141455531 |
7 | 2552642003565235 |
oct | 303123013336417 |
9 | 52433241346271 |
10 | 13411441032463 |
11 | 430083a911121 |
12 | 16072885715a7 |
13 | 7639026cb146 |
14 | 34518d8a0955 |
15 | 183ce06dadad |
hex | c32982dbd0f |
13411441032463 has 2 divisors, whose sum is σ = 13411441032464. Its totient is φ = 13411441032462.
The previous prime is 13411441032421. The next prime is 13411441032467. The reversal of 13411441032463 is 36423014411431.
13411441032463 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (36423014411431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13411441032463 - 225 = 13411407478031 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13411441032467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6705720516231 + 6705720516232.
It is an arithmetic number, because the mean of its divisors is an integer number (6705720516232).
Almost surely, 213411441032463 is an apocalyptic number.
13411441032463 is a deficient number, since it is larger than the sum of its proper divisors (1).
13411441032463 is an equidigital number, since it uses as much as digits as its factorization.
13411441032463 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 82944, while the sum is 37.
Adding to 13411441032463 its reverse (36423014411431), we get a palindrome (49834455443894).
The spelling of 13411441032463 in words is "thirteen trillion, four hundred eleven billion, four hundred forty-one million, thirty-two thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •