Base | Representation |
---|---|
bin | 10011001010110000… |
… | …10001011001100000 |
3 | 222120011221121102100 |
4 | 21211120101121200 |
5 | 132033420434003 |
6 | 4421051250400 |
7 | 513005216034 |
oct | 114530213140 |
9 | 28504847370 |
10 | 10290796128 |
11 | 4400982498 |
12 | 1bb2449a00 |
13 | c80014ba2 |
14 | 6d8a1c1c4 |
15 | 40369eba3 |
hex | 265611660 |
10290796128 has 36 divisors (see below), whose sum is σ = 29264452308. Its totient is φ = 3430265280.
The previous prime is 10290796121. The next prime is 10290796211. The reversal of 10290796128 is 82169709201.
10290796128 is a `hidden beast` number, since 1 + 0 + 29 + 0 + 7 + 9 + 612 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10290796121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 17865678 + ... + 17866253.
It is an arithmetic number, because the mean of its divisors is an integer number (812901453).
Almost surely, 210290796128 is an apocalyptic number.
10290796128 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
10290796128 is an abundant number, since it is smaller than the sum of its proper divisors (18973656180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10290796128 is a wasteful number, since it uses less digits than its factorization.
10290796128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35731947 (or 35731936 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 45.
The spelling of 10290796128 in words is "ten billion, two hundred ninety million, seven hundred ninety-six thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •