Base | Representation |
---|---|
bin | 111011110101110011… |
… | …011101110001010011 |
3 | 20010211221012112002022 |
4 | 323311303131301103 |
5 | 2023042340420342 |
6 | 45303450242055 |
7 | 4433155216331 |
oct | 736563356123 |
9 | 203757175068 |
10 | 64253451347 |
11 | 25282442008 |
12 | 1055242632b |
13 | 609ca2c1c7 |
14 | 3177740b51 |
15 | 1a10d8e9d2 |
hex | ef5cddc53 |
64253451347 has 4 divisors (see below), whose sum is σ = 64253968656. Its totient is φ = 64252934040.
The previous prime is 64253451331. The next prime is 64253451389. The reversal of 64253451347 is 74315435246.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 64253451347 - 24 = 64253451331 is a prime.
It is a super-2 number, since 2×642534513472 (a number of 22 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 = 64253451298 and 64253451307.
It is not an unprimeable number, because it can be changed into a prime (64253451547) by changing a digit.
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, 52133 + ... + 362249.
It is an arithmetic number, because the mean of its divisors is an integer number (16063492164).
Almost surely, 264253451347 is an apocalyptic number.
64253451347 is a deficient number, since it is larger than the sum of its proper divisors (517309).
64253451347 is a wasteful number, since it uses less digits than its factorization.
64253451347 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 517308.
The product of its digits is 1209600, while the sum is 44.
The spelling of 64253451347 in words is "sixty-four billion, two hundred fifty-three million, four hundred fifty-one thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •