Base | Representation |
---|---|
bin | 1000000001010001100100110… |
… | …1000110001000000001001001 |
3 | 2202000012110121211102222202010 |
4 | 2000110121031012020001021 |
5 | 1042432313134442224040 |
6 | 5320135242404530133 |
7 | 226605020642546610 |
oct | 20024311506100111 |
9 | 2660173554388663 |
10 | 564351406211145 |
11 | 1539020a6217063 |
12 | 533671000b0949 |
13 | 1b2b9156050b07 |
14 | 9d50a7a612877 |
15 | 453a11db7ee80 |
hex | 201464d188049 |
564351406211145 has 16 divisors (see below), whose sum is σ = 1031956857072000. Its totient is φ = 257989214267904.
The previous prime is 564351406211111. The next prime is 564351406211227. The reversal of 564351406211145 is 541112604153465.
It is not a de Polignac number, because 564351406211145 - 29 = 564351406210633 is a prime.
It is a super-2 number, since 2×5643514062111452 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 564351406211094 and 564351406211103.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2687387648520 + ... + 2687387648729.
It is an arithmetic number, because the mean of its divisors is an integer number (64497303567000).
Almost surely, 2564351406211145 is an apocalyptic number.
It is an amenable number.
564351406211145 is a deficient number, since it is larger than the sum of its proper divisors (467605450860855).
564351406211145 is a wasteful number, since it uses less digits than its factorization.
564351406211145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5374775297264.
The product of its (nonzero) digits is 1728000, while the sum is 48.
The spelling of 564351406211145 in words is "five hundred sixty-four trillion, three hundred fifty-one billion, four hundred six million, two hundred eleven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •