Base | Representation |
---|---|
bin | 10011000001100000… |
… | …11010110011000000 |
3 | 222100210000100102011 |
4 | 21200300122303000 |
5 | 131404042140000 |
6 | 4405241102304 |
7 | 511044051625 |
oct | 114060326300 |
9 | 28323010364 |
10 | 10213240000 |
11 | 4371120417 |
12 | 1b90487994 |
13 | c69c2bca2 |
14 | 6cc5d034c |
15 | 3eb9802ba |
hex | 260c1acc0 |
10213240000 has 140 divisors (see below), whose sum is σ = 25437894768. Its totient is φ = 4067200000.
The previous prime is 10213239997. The next prime is 10213240003. The reversal of 10213240000 is 4231201.
It is an interprime number because it is at equal distance from previous prime (10213239997) and next prime (10213240003).
It is not an unprimeable number, because it can be changed into a prime (10213240003) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 12439590 + ... + 12440410.
Almost surely, 210213240000 is an apocalyptic number.
10213240000 is a gapful number since it is divisible by the number (10) 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 10213240000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12718947384).
10213240000 is an abundant number, since it is smaller than the sum of its proper divisors (15224654768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10213240000 is an frugal number, since it uses more digits than its factorization.
10213240000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1164 (or 1139 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 10213240000 its reverse (4231201), we get a palindrome (10217471201).
The spelling of 10213240000 in words is "ten billion, two hundred thirteen million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •