Base | Representation |
---|---|
bin | 10011000100110100… |
… | …11001100100000010 |
3 | 222102201021211102220 |
4 | 21202122121210002 |
5 | 131433200202320 |
6 | 4412112351510 |
7 | 511532152416 |
oct | 114232314402 |
9 | 28381254386 |
10 | 10241022210 |
11 | 4385876621 |
12 | 1b99845596 |
13 | c72908673 |
14 | 6d2182d46 |
15 | 3ee11be40 |
hex | 262699902 |
10241022210 has 32 divisors (see below), whose sum is σ = 24981383232. Its totient is φ = 2686169280.
The previous prime is 10241022199. The next prime is 10241022217. The reversal of 10241022210 is 1222014201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10241022210.
It is not an unprimeable number, because it can be changed into a prime (10241022217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2796264 + ... + 2799923.
It is an arithmetic number, because the mean of its divisors is an integer number (780668226).
Almost surely, 210241022210 is an apocalyptic number.
10241022210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10241022210 is an abundant number, since it is smaller than the sum of its proper divisors (14740361022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10241022210 is a wasteful number, since it uses less digits than its factorization.
10241022210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5596258.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 10241022210 its reverse (1222014201), we get a palindrome (11463036411).
The spelling of 10241022210 in words is "ten billion, two hundred forty-one million, twenty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •