Base | Representation |
---|---|
bin | 11101010000111000010001… |
… | …11100010101111000011001 |
3 | 22102211221211210020200220000 |
4 | 32220130020330111320121 |
5 | 31413314132112010321 |
6 | 344510423153523213 |
7 | 16361152516413420 |
oct | 1650341074257031 |
9 | 272757753220800 |
10 | 64351645031961 |
11 | 19560419a81971 |
12 | 7273943873509 |
13 | 29ba445cb7321 |
14 | 11c68c9ba22b7 |
15 | 768e02208826 |
hex | 3a8708f15e19 |
64351645031961 has 80 divisors (see below), whose sum is σ = 116564532961536. Its totient is φ = 34538219265024.
The previous prime is 64351645031959. The next prime is 64351645031987. The reversal of 64351645031961 is 16913054615346.
64351645031961 is a `hidden beast` number, since 6 + 4 + 3 + 5 + 1 + 64 + 503 + 19 + 61 = 666.
It is not a de Polignac number, because 64351645031961 - 21 = 64351645031959 is a prime.
It is a super-3 number, since 3×643516450319613 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 64351645031898 and 64351645031907.
It is not an unprimeable number, because it can be changed into a prime (64351645031461) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 2160196 + ... + 11548581.
Almost surely, 264351645031961 is an apocalyptic number.
It is an amenable number.
64351645031961 is a deficient number, since it is larger than the sum of its proper divisors (52212887929575).
64351645031961 is a wasteful number, since it uses less digits than its factorization.
64351645031961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13709300 (or 13709291 counting only the distinct ones).
The product of its (nonzero) digits is 6998400, while the sum is 54.
The spelling of 64351645031961 in words is "sixty-four trillion, three hundred fifty-one billion, six hundred forty-five million, thirty-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •