Base | Representation |
---|---|
bin | 1001100110111010100001… |
… | …1010111101101000011111 |
3 | 1101101220220210101212012201 |
4 | 2121232220122331220133 |
5 | 2341040334424040333 |
6 | 34245034214112331 |
7 | 2140143330166225 |
oct | 231565032755037 |
9 | 41356823355181 |
10 | 10564150221343 |
11 | 340325a436274 |
12 | 12274a064b6a7 |
13 | 5b826c800744 |
14 | 2874440a0b15 |
15 | 134be782417d |
hex | 99ba86bda1f |
10564150221343 has 4 divisors (see below), whose sum is σ = 10573815501688. Its totient is φ = 10554484941000.
The previous prime is 10564150221341. The next prime is 10564150221349. The reversal of 10564150221343 is 34312205146501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10564150221343 - 21 = 10564150221341 is a prime.
It is a super-2 number, since 2×105641502213432 (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 (10564150221341) 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, 4832638533 + ... + 4832640718.
It is an arithmetic number, because the mean of its divisors is an integer number (2643453875422).
Almost surely, 210564150221343 is an apocalyptic number.
10564150221343 is a deficient number, since it is larger than the sum of its proper divisors (9665280345).
10564150221343 is an equidigital number, since it uses as much as digits as its factorization.
10564150221343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9665280344.
The product of its (nonzero) digits is 86400, while the sum is 37.
Adding to 10564150221343 its reverse (34312205146501), we get a palindrome (44876355367844).
The spelling of 10564150221343 in words is "ten trillion, five hundred sixty-four billion, one hundred fifty million, two hundred twenty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •