Base | Representation |
---|---|
bin | 1001010010000101001011… |
… | …0011110111001101010001 |
3 | 1100010201001211102011022102 |
4 | 2110201102303313031101 |
5 | 2314204330243404411 |
6 | 33412402244250145 |
7 | 2102242635251006 |
oct | 224412263671521 |
9 | 40121054364272 |
10 | 10206231622481 |
11 | 3285490747444 |
12 | 118a0523a0955 |
13 | 59059c52007b |
14 | 273dacab38ad |
15 | 12a74a503d3b |
hex | 94852cf7351 |
10206231622481 has 2 divisors, whose sum is σ = 10206231622482. Its totient is φ = 10206231622480.
The previous prime is 10206231622469. The next prime is 10206231622501. The reversal of 10206231622481 is 18422613260201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9117984160000 + 1088247462481 = 3019600^2 + 1043191^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10206231622481 is a prime.
It is a super-2 number, since 2×102062316224812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10206231622981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5103115811240 + 5103115811241.
It is an arithmetic number, because the mean of its divisors is an integer number (5103115811241).
Almost surely, 210206231622481 is an apocalyptic number.
It is an amenable number.
10206231622481 is a deficient number, since it is larger than the sum of its proper divisors (1).
10206231622481 is an equidigital number, since it uses as much as digits as its factorization.
10206231622481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 38.
Adding to 10206231622481 its reverse (18422613260201), we get a palindrome (28628844882682).
The spelling of 10206231622481 in words is "ten trillion, two hundred six billion, two hundred thirty-one million, six hundred twenty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •