Base | Representation |
---|---|
bin | 10011101100100001001101… |
… | …01111001000001011110001 |
3 | 12200100111112000220212222221 |
4 | 21312100212233020023301 |
5 | 21134102113111220421 |
6 | 232040502242401041 |
7 | 12060060302402641 |
oct | 1166204657101361 |
9 | 180314460825887 |
10 | 43311100101361 |
11 | 12889152986534 |
12 | 4a35b93960181 |
13 | 1b222b07cb581 |
14 | a9a3a8800521 |
15 | 50194b383841 |
hex | 276426bc82f1 |
43311100101361 has 2 divisors, whose sum is σ = 43311100101362. Its totient is φ = 43311100101360.
The previous prime is 43311100101293. The next prime is 43311100101431. The reversal of 43311100101361 is 16310100111334.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24588517259761 + 18722582841600 = 4958681^2 + 4326960^2 .
It is a cyclic number.
It is not a de Polignac number, because 43311100101361 - 225 = 43311066546929 is a prime.
It is a super-2 number, since 2×433111001013612 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (43311100111361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21655550050680 + 21655550050681.
It is an arithmetic number, because the mean of its divisors is an integer number (21655550050681).
Almost surely, 243311100101361 is an apocalyptic number.
It is an amenable number.
43311100101361 is a deficient number, since it is larger than the sum of its proper divisors (1).
43311100101361 is an equidigital number, since it uses as much as digits as its factorization.
43311100101361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 43311100101361 its reverse (16310100111334), we get a palindrome (59621200212695).
The spelling of 43311100101361 in words is "forty-three trillion, three hundred eleven billion, one hundred million, one hundred one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •