Base | Representation |
---|---|
bin | 10011001011010111… |
… | …01111100000000000 |
3 | 222120112112220211120 |
4 | 21211223233200000 |
5 | 132041222301120 |
6 | 4421352512240 |
7 | 513066464430 |
oct | 114553574000 |
9 | 28515486746 |
10 | 10295900160 |
11 | 44038491a7 |
12 | 1bb40ab680 |
13 | c810b1120 |
14 | 6d958a2c0 |
15 | 403d5c140 |
hex | 265aef800 |
10295900160 has 768 divisors, whose sum is σ = 42268262400. Its totient is φ = 2080899072.
The previous prime is 10295900143. The next prime is 10295900161. The reversal of 10295900160 is 6100959201.
It is a tau number, because it is divible by the number of its divisors (768).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10295900161) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 81070017 + ... + 81070143.
It is an arithmetic number, because the mean of its divisors is an integer number (55036800).
Almost surely, 210295900160 is an apocalyptic number.
10295900160 is a gapful number since it is divisible by the number (10) 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 10295900160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21134131200).
10295900160 is an abundant number, since it is smaller than the sum of its proper divisors (31972362240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10295900160 is a wasteful number, since it uses less digits than its factorization.
10295900160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206 (or 186 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 33.
The spelling of 10295900160 in words is "ten billion, two hundred ninety-five million, nine hundred thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •