Base | Representation |
---|---|
bin | 100110100010… |
… | …100010111000 |
3 | 201000021200000 |
4 | 212202202320 |
5 | 10041243333 |
6 | 1000313000 |
7 | 151605501 |
oct | 46424270 |
9 | 21007600 |
10 | 10102968 |
11 | 5780567 |
12 | 3472760 |
13 | 21296b5 |
14 | 14adba8 |
15 | d48713 |
hex | 9a28b8 |
10102968 has 48 divisors (see below), whose sum is σ = 28381080. Its totient is φ = 3367008.
The previous prime is 10102951. The next prime is 10102969. The reversal of 10102968 is 86920101.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102969) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 655 + ... + 4542.
Almost surely, 210102968 is an apocalyptic number.
10102968 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 10102968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14190540).
10102968 is an abundant number, since it is smaller than the sum of its proper divisors (18278112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102968 is an equidigital number, since it uses as much as digits as its factorization.
10102968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5218 (or 5202 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The square root of 10102968 is about 3178.5166351618. The cubic root of 10102968 is about 216.1804048381.
The spelling of 10102968 in words is "ten million, one hundred two thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •