Base | Representation |
---|---|
bin | 11101010011110011011100… |
… | …11000110111011110010101 |
3 | 22110012120012211210210102100 |
4 | 32221321232120313132111 |
5 | 31421440431100144323 |
6 | 345024522250232313 |
7 | 16401340616262351 |
oct | 1651715630673625 |
9 | 273176184723370 |
10 | 64452131256213 |
11 | 19599aa4915498 |
12 | 728b308425699 |
13 | 29c6a6b46780c |
14 | 11cb6dd630461 |
15 | 76b833e89943 |
hex | 3a9e6e637795 |
64452131256213 has 48 divisors (see below), whose sum is σ = 96360344720640. Its totient is φ = 41463794198400.
The previous prime is 64452131256209. The next prime is 64452131256259. The reversal of 64452131256213 is 31265213125446.
64452131256213 is a `hidden beast` number, since 6 + 4 + 4 + 5 + 2 + 1 + 3 + 12 + 5 + 621 + 3 = 666.
It is not a de Polignac number, because 64452131256213 - 22 = 64452131256209 is a prime.
It is a super-2 number, since 2×644521312562132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64452131256263) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5769588118 + ... + 5769599288.
It is an arithmetic number, because the mean of its divisors is an integer number (2007507181680).
Almost surely, 264452131256213 is an apocalyptic number.
It is an amenable number.
64452131256213 is a deficient number, since it is larger than the sum of its proper divisors (31908213464427).
64452131256213 is a wasteful number, since it uses less digits than its factorization.
64452131256213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21290 (or 21287 counting only the distinct ones).
The product of its digits is 1036800, while the sum is 45.
The spelling of 64452131256213 in words is "sixty-four trillion, four hundred fifty-two billion, one hundred thirty-one million, two hundred fifty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •