Base | Representation |
---|---|
bin | 1001001000100110010001… |
… | …0010111011100111111101 |
3 | 1022120010112222100100022222 |
4 | 2102021210102323213331 |
5 | 2304022202423104321 |
6 | 33205500310015125 |
7 | 2054414511224204 |
oct | 222114422734775 |
9 | 38503488310288 |
10 | 10043316222461 |
11 | 322238a1a7085 |
12 | 11625663474a5 |
13 | 57b10827cca2 |
14 | 26a155cda23b |
15 | 1263b2b343ab |
hex | 922644bb9fd |
10043316222461 has 2 divisors, whose sum is σ = 10043316222462. Its totient is φ = 10043316222460.
The previous prime is 10043316222437. The next prime is 10043316222469. The reversal of 10043316222461 is 16422261334001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9002814219961 + 1040502002500 = 3000469^2 + 1020050^2 .
It is a cyclic number.
It is not a de Polignac number, because 10043316222461 - 26 = 10043316222397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10043316222469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5021658111230 + 5021658111231.
It is an arithmetic number, because the mean of its divisors is an integer number (5021658111231).
Almost surely, 210043316222461 is an apocalyptic number.
It is an amenable number.
10043316222461 is a deficient number, since it is larger than the sum of its proper divisors (1).
10043316222461 is an equidigital number, since it uses as much as digits as its factorization.
10043316222461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
Adding to 10043316222461 its reverse (16422261334001), we get a palindrome (26465577556462).
The spelling of 10043316222461 in words is "ten trillion, forty-three billion, three hundred sixteen million, two hundred twenty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •