Base | Representation |
---|---|
bin | 11101000110101011101110… |
… | …11011010000000011011110 |
3 | 22101121110120102112200010010 |
4 | 32203111313123100003132 |
5 | 31342044141143410141 |
6 | 344041444014224050 |
7 | 16323641105046105 |
oct | 1643256733200336 |
9 | 271543512480103 |
10 | 64001311310046 |
11 | 194358927a6390 |
12 | 7217a717b5026 |
13 | 29933b4241b16 |
14 | 11b3973c9d03c |
15 | 75ec4ac34416 |
hex | 3a35776d00de |
64001311310046 has 64 divisors (see below), whose sum is σ = 148204493289216. Its totient is φ = 18210135820800.
The previous prime is 64001311310011. The next prime is 64001311310047.
64001311310046 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 64001311309995 and 64001311310022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64001311310047) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67273680 + ... + 68218403.
It is an arithmetic number, because the mean of its divisors is an integer number (2315695207644).
Almost surely, 264001311310046 is an apocalyptic number.
64001311310046 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
64001311310046 is an abundant number, since it is smaller than the sum of its proper divisors (84203181979170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64001311310046 is a wasteful number, since it uses less digits than its factorization.
64001311310046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135492537.
The product of its (nonzero) digits is 5184, while the sum is 30.
It can be divided in two parts, 6400131 and 1310046, that added together give a palindrome (7710177).
The spelling of 64001311310046 in words is "sixty-four trillion, one billion, three hundred eleven million, three hundred ten thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •