Base | Representation |
---|---|
bin | 111111011100001… |
… | …0111101000010000 |
3 | 12111100112110202100 |
4 | 1332320113220100 |
5 | 13324422043224 |
6 | 551121320400 |
7 | 103515463062 |
oct | 17670275020 |
9 | 5440473670 |
10 | 2128706064 |
11 | 9a2665411 |
12 | 4b4a96100 |
13 | 27c02bbb4 |
14 | 1629dd732 |
15 | c6d37ac9 |
hex | 7ee17a10 |
2128706064 has 30 divisors (see below), whose sum is σ = 5957420846. Its totient is φ = 709568640.
The previous prime is 2128706039. The next prime is 2128706077. The reversal of 2128706064 is 4606078212.
2128706064 is a `hidden beast` number, since 21 + 28 + 7 + 0 + 606 + 4 = 666.
2128706064 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 1529435664 + 599270400 = 39108^2 + 24480^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7391197 + ... + 7391484.
Almost surely, 22128706064 is an apocalyptic number.
2128706064 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
2128706064 is an abundant number, since it is smaller than the sum of its proper divisors (3828714782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2128706064 is a wasteful number, since it uses less digits than its factorization.
2128706064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14782695 (or 14782686 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 2128706064 is about 46137.9026831520. The cubic root of 2128706064 is about 1286.3877600101.
The spelling of 2128706064 in words is "two billion, one hundred twenty-eight million, seven hundred six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •