Base | Representation |
---|---|
bin | 10010101010100111… |
… | …11011001101111000 |
3 | 221212101200210012020 |
4 | 21111103323031320 |
5 | 131010413034430 |
6 | 4334221314440 |
7 | 503222655312 |
oct | 112523731570 |
9 | 27771623166 |
10 | 10021221240 |
11 | 4282799928 |
12 | 1b38105a20 |
13 | c3920a714 |
14 | 6b0cc87b2 |
15 | 3d9ba0b10 |
hex | 2554fb378 |
10021221240 has 32 divisors (see below), whose sum is σ = 30063664080. Its totient is φ = 2672325632.
The previous prime is 10021221239. The next prime is 10021221241. The reversal of 10021221240 is 4212212001.
It is an interprime number because it is at equal distance from previous prime (10021221239) and next prime (10021221241).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021221241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41754969 + ... + 41755208.
Almost surely, 210021221240 is an apocalyptic number.
10021221240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10021221240 is an abundant number, since it is smaller than the sum of its proper divisors (20042442840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10021221240 is a wasteful number, since it uses less digits than its factorization.
10021221240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83510191 (or 83510187 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 10021221240 its reverse (4212212001), we get a palindrome (14233433241).
The spelling of 10021221240 in words is "ten billion, twenty-one million, two hundred twenty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •