Base | Representation |
---|---|
bin | 10100100100001011001… |
… | …010000101100101110101 |
3 | 12000002210112021021211201 |
4 | 110210023022011211311 |
5 | 141123244221342401 |
6 | 3001121330132501 |
7 | 204050122662454 |
oct | 24441312054565 |
9 | 5002715237751 |
10 | 1413231434101 |
11 | 4a53913355a3 |
12 | 1a9a88421131 |
13 | a3361c1a816 |
14 | 4c5879bab9b |
15 | 26b64a79b01 |
hex | 1490b285975 |
1413231434101 has 2 divisors, whose sum is σ = 1413231434102. Its totient is φ = 1413231434100.
The previous prime is 1413231434063. The next prime is 1413231434107. The reversal of 1413231434101 is 1014341323141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1189124820900 + 224106613201 = 1090470^2 + 473399^2 .
It is a cyclic number.
It is not a de Polignac number, because 1413231434101 - 237 = 1275792480629 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1413231434101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1413231434107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 706615717050 + 706615717051.
It is an arithmetic number, because the mean of its divisors is an integer number (706615717051).
Almost surely, 21413231434101 is an apocalyptic number.
It is an amenable number.
1413231434101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1413231434101 is an equidigital number, since it uses as much as digits as its factorization.
1413231434101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 1413231434101 its reverse (1014341323141), we get a palindrome (2427572757242).
The spelling of 1413231434101 in words is "one trillion, four hundred thirteen billion, two hundred thirty-one million, four hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •