Base | Representation |
---|---|
bin | 1001010100001110100010… |
… | …1100101010000100011111 |
3 | 1100021020020200011101111021 |
4 | 2111003220230222010133 |
5 | 2320310340122220211 |
6 | 33441341251305011 |
7 | 2105016500614345 |
oct | 225035054520437 |
9 | 40236220141437 |
10 | 10243106054431 |
11 | 329a09336a998 |
12 | 11952235ab167 |
13 | 593bc7b94983 |
14 | 275aaa10d995 |
15 | 12b6a78e1771 |
hex | 950e8b2a11f |
10243106054431 has 8 divisors (see below), whose sum is σ = 10248722159360. Its totient is φ = 10237491200088.
The previous prime is 10243106054359. The next prime is 10243106054507. The reversal of 10243106054431 is 13445060134201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10243106054431 - 215 = 10243106021663 is a prime.
It is a super-2 number, since 2×102431060544312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10243106055431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16314730 + ... + 16930936.
It is an arithmetic number, because the mean of its divisors is an integer number (1281090269920).
Almost surely, 210243106054431 is an apocalyptic number.
10243106054431 is a deficient number, since it is larger than the sum of its proper divisors (5616104929).
10243106054431 is an equidigital number, since it uses as much as digits as its factorization.
10243106054431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 625293.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 10243106054431 its reverse (13445060134201), we get a palindrome (23688166188632).
The spelling of 10243106054431 in words is "ten trillion, two hundred forty-three billion, one hundred six million, fifty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •