Base | Representation |
---|---|
bin | 11101010000101101110001… |
… | …01010101000100110000011 |
3 | 22102211102021121020020201210 |
4 | 32220112320222220212003 |
5 | 31413221103312323233 |
6 | 344504051254501203 |
7 | 16360562642131263 |
oct | 1650267052504603 |
9 | 272742247206653 |
10 | 64346003245443 |
11 | 19558a94376187 |
12 | 727282a364803 |
13 | 29b9a571bc0ca |
14 | 11c651279b7a3 |
15 | 768bc1c7d163 |
hex | 3a85b8aa8983 |
64346003245443 has 4 divisors (see below), whose sum is σ = 85794670993928. Its totient is φ = 42897335496960.
The previous prime is 64346003245411. The next prime is 64346003245499. The reversal of 64346003245443 is 34454230064346.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 64346003245443 - 25 = 64346003245411 is a prime.
It is a super-2 number, since 2×643460032454432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 64346003245392 and 64346003245401.
It is not an unprimeable number, because it can be changed into a prime (64346003246443) 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, 10724333874238 + ... + 10724333874243.
It is an arithmetic number, because the mean of its divisors is an integer number (21448667748482).
Almost surely, 264346003245443 is an apocalyptic number.
64346003245443 is a deficient number, since it is larger than the sum of its proper divisors (21448667748485).
64346003245443 is a wasteful number, since it uses less digits than its factorization.
64346003245443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21448667748484.
The product of its (nonzero) digits is 9953280, while the sum is 48.
The spelling of 64346003245443 in words is "sixty-four trillion, three hundred forty-six billion, three million, two hundred forty-five thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •