Base | Representation |
---|---|
bin | 11101100101110000010101… |
… | …10100011011101010100100 |
3 | 22112101112022000211220002222 |
4 | 32302320022310123222210 |
5 | 32012042140112120424 |
6 | 350220131225451512 |
7 | 16464034615445300 |
oct | 1662701264335244 |
9 | 275345260756088 |
10 | 65068936051364 |
11 | 1980764306a343 |
12 | 736a967040b98 |
13 | 2a3cc8881c89b |
14 | 120d4d369cd00 |
15 | 77c8d42c0e5e |
hex | 3b2e0ad1baa4 |
65068936051364 has 36 divisors (see below), whose sum is σ = 132473823286896. Its totient is φ = 27884147803344.
The previous prime is 65068936051313. The next prime is 65068936051373. The reversal of 65068936051364 is 46315063986056.
65068936051364 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 65068936051297 and 65068936051306.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 12954602 + ... + 17261505.
It is an arithmetic number, because the mean of its divisors is an integer number (3679828424636).
Almost surely, 265068936051364 is an apocalyptic number.
It is an amenable number.
65068936051364 is an abundant number, since it is smaller than the sum of its proper divisors (67404887235532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65068936051364 is a wasteful number, since it uses less digits than its factorization.
65068936051364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30227112 (or 30227103 counting only the distinct ones).
The product of its (nonzero) digits is 83980800, while the sum is 62.
The spelling of 65068936051364 in words is "sixty-five trillion, sixty-eight billion, nine hundred thirty-six million, fifty-one thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •