Base | Representation |
---|---|
bin | 10011000110100111… |
… | …10010111100010000 |
3 | 222110202121020220000 |
4 | 21203103302330100 |
5 | 132001023141433 |
6 | 4413411050000 |
7 | 512104066650 |
oct | 114323627420 |
9 | 28422536800 |
10 | 10256068368 |
11 | 4393312a67 |
12 | 1ba28a0900 |
13 | c75a76010 |
14 | 6d417c360 |
15 | 4005e0113 |
hex | 2634f2f10 |
10256068368 has 800 divisors, whose sum is σ = 40330752000. Its totient is φ = 2438802432.
The previous prime is 10256068367. The next prime is 10256068379. The reversal of 10256068368 is 86386065201.
10256068368 is a `hidden beast` number, since 1 + 0 + 2 + 5 + 606 + 8 + 36 + 8 = 666.
It is not an unprimeable number, because it can be changed into a prime (10256068367) by changing a digit.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 51537933 + ... + 51538131.
It is an arithmetic number, because the mean of its divisors is an integer number (50413440).
Almost surely, 210256068368 is an apocalyptic number.
10256068368 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10256068368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20165376000).
10256068368 is an abundant number, since it is smaller than the sum of its proper divisors (30074683632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10256068368 is a wasteful number, since it uses less digits than its factorization.
10256068368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 281 (or 266 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 45.
The spelling of 10256068368 in words is "ten billion, two hundred fifty-six million, sixty-eight thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •