Base | Representation |
---|---|
bin | 1001010100010010000010… |
… | …0001000101100111000001 |
3 | 1100021022122221100001212102 |
4 | 2111010200201011213001 |
5 | 2320314244342424401 |
6 | 33442014223440145 |
7 | 2105051631635324 |
oct | 225044041054701 |
9 | 40238587301772 |
10 | 10244042545601 |
11 | 329a523a56637 |
12 | 1195445156055 |
13 | 594016bc6a67 |
14 | 275b586487bb |
15 | 12b70ec2a56b |
hex | 951208459c1 |
10244042545601 has 4 divisors (see below), whose sum is σ = 10783202679600. Its totient is φ = 9704882411604.
The previous prime is 10244042545591. The next prime is 10244042545613. The reversal of 10244042545601 is 10654524044201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10244042545601 - 26 = 10244042545537 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10244042545631) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 269580066971 + ... + 269580067008.
It is an arithmetic number, because the mean of its divisors is an integer number (2695800669900).
Almost surely, 210244042545601 is an apocalyptic number.
It is an amenable number.
10244042545601 is a deficient number, since it is larger than the sum of its proper divisors (539160133999).
10244042545601 is an equidigital number, since it uses as much as digits as its factorization.
10244042545601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539160133998.
The product of its (nonzero) digits is 153600, while the sum is 38.
Adding to 10244042545601 its reverse (10654524044201), we get a palindrome (20898566589802).
The spelling of 10244042545601 in words is "ten trillion, two hundred forty-four billion, forty-two million, five hundred forty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •