Base | Representation |
---|---|
bin | 1001100110111010100001… |
… | …1011010101110001001000 |
3 | 1101101220220210120212211002 |
4 | 2121232220123111301020 |
5 | 2341040334440221300 |
6 | 34245034220154132 |
7 | 2140143331060361 |
oct | 231565033256110 |
9 | 41356823525732 |
10 | 10564150320200 |
11 | 340325a4a3574 |
12 | 12274a0698948 |
13 | 5b826c836739 |
14 | 2874440c8b68 |
15 | 134be78435d5 |
hex | 99ba86d5c48 |
10564150320200 has 24 divisors (see below), whose sum is σ = 24561649494930. Its totient is φ = 4225660128000.
The previous prime is 10564150320151. The next prime is 10564150320263. The reversal of 10564150320200 is 202305146501.
It can be written as a sum of positive squares in 3 ways, for example, as 9763837581796 + 800312738404 = 3124714^2 + 894602^2 .
It is a super-2 number, since 2×105641503202002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 26410375601 + ... + 26410376000.
Almost surely, 210564150320200 is an apocalyptic number.
10564150320200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10564150320200 is an abundant number, since it is smaller than the sum of its proper divisors (13997499174730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10564150320200 is a wasteful number, since it uses less digits than its factorization.
10564150320200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52820751617 (or 52820751608 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 10564150320200 its reverse (202305146501), we get a palindrome (10766455466701).
The spelling of 10564150320200 in words is "ten trillion, five hundred sixty-four billion, one hundred fifty million, three hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •