Base | Representation |
---|---|
bin | 11101011111011000100101… |
… | …00111011100101111100111 |
3 | 22111121121020122022202110120 |
4 | 32233230102213130233213 |
5 | 32000000322011033133 |
6 | 345531404534453023 |
7 | 16442155015653333 |
oct | 1657542247345747 |
9 | 274547218282416 |
10 | 64850023533543 |
11 | 19732816714626 |
12 | 7334451804173 |
13 | 2a2543c212b81 |
14 | 1202a878d67c3 |
15 | 776d707e2ab3 |
hex | 3afb129dcbe7 |
64850023533543 has 32 divisors (see below), whose sum is σ = 91756349878464. Its totient is φ = 40599883917312.
The previous prime is 64850023533541. The next prime is 64850023533587. The reversal of 64850023533543 is 34533532005846.
It is not a de Polignac number, because 64850023533543 - 21 = 64850023533541 is a prime.
It is a super-2 number, since 2×648500235335432 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64850023533541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66471021 + ... + 67439577.
It is an arithmetic number, because the mean of its divisors is an integer number (2867385933702).
Almost surely, 264850023533543 is an apocalyptic number.
64850023533543 is a deficient number, since it is larger than the sum of its proper divisors (26906326344921).
64850023533543 is a wasteful number, since it uses less digits than its factorization.
64850023533543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 971491.
The product of its (nonzero) digits is 15552000, while the sum is 51.
The spelling of 64850023533543 in words is "sixty-four trillion, eight hundred fifty billion, twenty-three million, five hundred thirty-three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •