Base | Representation |
---|---|
bin | 1001010100010011100001… |
… | …1001111101111100110001 |
3 | 1100021100200212111010222222 |
4 | 2111010320121331330301 |
5 | 2320321104443114101 |
6 | 33442122102010425 |
7 | 2105064566365055 |
oct | 225047031757461 |
9 | 40240625433888 |
10 | 10244443332401 |
11 | 329a70a2096a3 |
12 | 1195537416a15 |
13 | 59407bc52505 |
14 | 275b95975c65 |
15 | 12b734ee701b |
hex | 9513867df31 |
10244443332401 has 2 divisors, whose sum is σ = 10244443332402. Its totient is φ = 10244443332400.
The previous prime is 10244443332379. The next prime is 10244443332467. The reversal of 10244443332401 is 10423334444201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9981429235600 + 263014096801 = 3159340^2 + 512849^2 .
It is a cyclic number.
It is not a de Polignac number, because 10244443332401 - 222 = 10244439138097 is a prime.
It is not a weakly prime, because it can be changed into another prime (10244443332301) 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, 5122221666200 + 5122221666201.
It is an arithmetic number, because the mean of its divisors is an integer number (5122221666201).
Almost surely, 210244443332401 is an apocalyptic number.
It is an amenable number.
10244443332401 is a deficient number, since it is larger than the sum of its proper divisors (1).
10244443332401 is an equidigital number, since it uses as much as digits as its factorization.
10244443332401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110592, while the sum is 35.
Adding to 10244443332401 its reverse (10423334444201), we get a palindrome (20667777776602).
The spelling of 10244443332401 in words is "ten trillion, two hundred forty-four billion, four hundred forty-three million, three hundred thirty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •