Base | Representation |
---|---|
bin | 100000000101101010… |
… | …0011111111111100100 |
3 | 20120212102012012222100 |
4 | 1000023110133333210 |
5 | 2112111301300121 |
6 | 51353451332100 |
7 | 4656432143631 |
oct | 1001324377744 |
9 | 216772165870 |
10 | 68909400036 |
11 | 27251618194 |
12 | 11431751030 |
13 | 6662508429 |
14 | 3499c43188 |
15 | 1bd49d5026 |
hex | 100b51ffe4 |
68909400036 has 81 divisors (see below), whose sum is σ = 177097474281. Its totient is φ = 22592316384.
The previous prime is 68909400019. The next prime is 68909400083. The reversal of 68909400036 is 63000490986.
The square root of 68909400036 is 262506.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 16035156900 + 52874243136 = 126630^2 + 229944^2 .
It is a junction number, because it is equal to n+sod(n) for n = 68909399964 and 68909400000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 105527086 + ... + 105527738.
Almost surely, 268909400036 is an apocalyptic number.
68909400036 is the 262506-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68909400036
68909400036 is an abundant number, since it is smaller than the sum of its proper divisors (108188074245).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68909400036 is an equidigital number, since it uses as much as digits as its factorization.
68909400036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1450 (or 725 counting only the distinct ones).
The product of its (nonzero) digits is 279936, while the sum is 45.
The spelling of 68909400036 in words is "sixty-eight billion, nine hundred nine million, four hundred thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •