Base | Representation |
---|---|
bin | 10011001011010110… |
… | …10011111001011000 |
3 | 222120112100011202000 |
4 | 21211223103321120 |
5 | 132041210141341 |
6 | 4421350241000 |
7 | 513065514000 |
oct | 114553237130 |
9 | 28515304660 |
10 | 10295787096 |
11 | 4403781261 |
12 | 1bb4056160 |
13 | c8107181a |
14 | 6d955b000 |
15 | 403d388b6 |
hex | 265ad3e58 |
10295787096 has 128 divisors (see below), whose sum is σ = 33352320000. Its totient is φ = 2941632288.
The previous prime is 10295787083. The next prime is 10295787097. The reversal of 10295787096 is 69078759201.
It is a super-2 number, since 2×102957870962 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10295787097) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4605 + ... + 143571.
It is an arithmetic number, because the mean of its divisors is an integer number (260565000).
Almost surely, 210295787096 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10295787096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16676160000).
10295787096 is an abundant number, since it is smaller than the sum of its proper divisors (23056532904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10295787096 is a wasteful number, since it uses less digits than its factorization.
10295787096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139003 (or 138979 counting only the distinct ones).
The product of its (nonzero) digits is 1905120, while the sum is 54.
The spelling of 10295787096 in words is "ten billion, two hundred ninety-five million, seven hundred eighty-seven thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •