Base | Representation |
---|---|
bin | 1001010100010010011001… |
… | …1010100111011111010111 |
3 | 1100021022220211120010011011 |
4 | 2111010212122213133113 |
5 | 2320320000211401123 |
6 | 33442032120553051 |
7 | 2105054243066122 |
oct | 225044632473727 |
9 | 40238824503134 |
10 | 10244141512663 |
11 | 329a574901aa3 |
12 | 1195472322787 |
13 | 594031568356 |
14 | 275b6784b3b9 |
15 | 12b718778e0d |
hex | 951266a77d7 |
10244141512663 has 4 divisors (see below), whose sum is σ = 10244152116288. Its totient is φ = 10244130909040.
The previous prime is 10244141512621. The next prime is 10244141512727. The reversal of 10244141512663 is 36621514144201.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10244141512663 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10244141513663) 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, 3689158 + ... + 5839363.
It is an arithmetic number, because the mean of its divisors is an integer number (2561038029072).
Almost surely, 210244141512663 is an apocalyptic number.
10244141512663 is a deficient number, since it is larger than the sum of its proper divisors (10603625).
10244141512663 is an equidigital number, since it uses as much as digits as its factorization.
10244141512663 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10603624.
The product of its (nonzero) digits is 138240, while the sum is 40.
Adding to 10244141512663 its reverse (36621514144201), we get a palindrome (46865655656864).
The spelling of 10244141512663 in words is "ten trillion, two hundred forty-four billion, one hundred forty-one million, five hundred twelve thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •