Base | Representation |
---|---|
bin | 1001101001111010001100… |
… | …01100111001011101111001 |
3 | 2210011200102220121021002222 |
4 | 10310331012030321131321 |
5 | 10240322444442132421 |
6 | 113053251255133425 |
7 | 4320621645660365 |
oct | 464750614713571 |
9 | 83150386537088 |
10 | 21231201130361 |
11 | 68461135a6182 |
12 | 246a8ba374275 |
13 | bb012aa62651 |
14 | 53584a5362a5 |
15 | 26c413d5acab |
hex | 134f46339779 |
21231201130361 has 2 divisors, whose sum is σ = 21231201130362. Its totient is φ = 21231201130360.
The previous prime is 21231201130343. The next prime is 21231201130463. The reversal of 21231201130361 is 16303110213212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11931628899961 + 9299572230400 = 3454219^2 + 3049520^2 .
It is a cyclic number.
It is not a de Polignac number, because 21231201130361 - 210 = 21231201129337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21231201130361.
It is not a weakly prime, because it can be changed into another prime (21231201130301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10615600565180 + 10615600565181.
It is an arithmetic number, because the mean of its divisors is an integer number (10615600565181).
Almost surely, 221231201130361 is an apocalyptic number.
It is an amenable number.
21231201130361 is a deficient number, since it is larger than the sum of its proper divisors (1).
21231201130361 is an equidigital number, since it uses as much as digits as its factorization.
21231201130361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 21231201130361 its reverse (16303110213212), we get a palindrome (37534311343573).
The spelling of 21231201130361 in words is "twenty-one trillion, two hundred thirty-one billion, two hundred one million, one hundred thirty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •