Base | Representation |
---|---|
bin | 10010101010111101… |
… | …00100100011100000 |
3 | 221212120221120101201 |
4 | 21111132210203200 |
5 | 131012121341000 |
6 | 4334401210544 |
7 | 503255460532 |
oct | 112536444340 |
9 | 27776846351 |
10 | 10024012000 |
11 | 4284325642 |
12 | 1b39030a54 |
13 | c39976a62 |
14 | 6b1413852 |
15 | 3da05296a |
hex | 2557a48e0 |
10024012000 has 48 divisors (see below), whose sum is σ = 24629007312. Its totient is φ = 4009603200.
The previous prime is 10024011979. The next prime is 10024012003. The reversal of 10024012000 is 21042001.
It is a super-3 number, since 3×100240120003 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10024012003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1249002 + ... + 1257001.
It is an arithmetic number, because the mean of its divisors is an integer number (513104319).
Almost surely, 210024012000 is an apocalyptic number.
10024012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10024012000 is an abundant number, since it is smaller than the sum of its proper divisors (14604995312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10024012000 is an equidigital number, since it uses as much as digits as its factorization.
10024012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2506028 (or 2506010 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 10024012000 its reverse (21042001), we get a palindrome (10045054001).
The spelling of 10024012000 in words is "ten billion, twenty-four million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •