Base | Representation |
---|---|
bin | 1000000001000101010111011… |
… | …0101110101000111010110100 |
3 | 2201222110102012122120110212002 |
4 | 2000101111312232220322310 |
5 | 1042420344100213100040 |
6 | 5315455032525114432 |
7 | 226553614011326513 |
oct | 20021256656507264 |
9 | 2658412178513762 |
10 | 564141651300020 |
11 | 15383114901a842 |
12 | 533325216b8a18 |
13 | 1b2a2438a576a1 |
14 | 9d4485cb6a67a |
15 | 4534944111a15 |
hex | 2011576ba8eb4 |
564141651300020 has 12 divisors (see below), whose sum is σ = 1184697467730084. Its totient is φ = 225656660520000.
The previous prime is 564141651299981. The next prime is 564141651300041. The reversal of 564141651300020 is 20003156141465.
It can be written as a sum of positive squares in 2 ways, for example, as 62854896459664 + 501286754840356 = 7928108^2 + 22389434^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14103541282481 + ... + 14103541282520.
It is an arithmetic number, because the mean of its divisors is an integer number (98724788977507).
Almost surely, 2564141651300020 is an apocalyptic number.
It is an amenable number.
564141651300020 is an abundant number, since it is smaller than the sum of its proper divisors (620555816430064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
564141651300020 is a wasteful number, since it uses less digits than its factorization.
564141651300020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28207082565010 (or 28207082565008 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 38.
The spelling of 564141651300020 in words is "five hundred sixty-four trillion, one hundred forty-one billion, six hundred fifty-one million, three hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •