Base | Representation |
---|---|
bin | 10011001011010011… |
… | …01110100010010000 |
3 | 222120111120002020010 |
4 | 21211221232202100 |
5 | 132041103400140 |
6 | 4421333314520 |
7 | 513062134401 |
oct | 114551564220 |
9 | 28514502203 |
10 | 10295371920 |
11 | 4403518339 |
12 | 1bb3a95a40 |
13 | c80c57862 |
14 | 6d948d9a8 |
15 | 403ca5880 |
hex | 265a6e890 |
10295371920 has 80 divisors (see below), whose sum is σ = 33595439040. Its totient is φ = 2600934912.
The previous prime is 10295371913. The next prime is 10295371927. The reversal of 10295371920 is 2917359201.
It is an interprime number because it is at equal distance from previous prime (10295371913) and next prime (10295371927).
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×102953719202 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10295371927) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1124319 + ... + 1133438.
It is an arithmetic number, because the mean of its divisors is an integer number (419942988).
Almost surely, 210295371920 is an apocalyptic number.
10295371920 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10295371920 is an abundant number, since it is smaller than the sum of its proper divisors (23300067120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10295371920 is a wasteful number, since it uses less digits than its factorization.
10295371920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2257792 (or 2257786 counting only the distinct ones).
The product of its (nonzero) digits is 34020, while the sum is 39.
The spelling of 10295371920 in words is "ten billion, two hundred ninety-five million, three hundred seventy-one thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •