Base | Representation |
---|---|
bin | 10011111100010111… |
… | …11110101101000000 |
3 | 1000122012010011121000 |
4 | 21332023332231000 |
5 | 133411443113344 |
6 | 4530240132000 |
7 | 526221014520 |
oct | 117613765500 |
9 | 30565104530 |
10 | 10707004224 |
11 | 45a4908824 |
12 | 20a9907000 |
13 | 101830c977 |
14 | 738001680 |
15 | 429eb5a69 |
hex | 27e2feb40 |
10707004224 has 112 divisors (see below), whose sum is σ = 35973308800. Its totient is φ = 3059140608.
The previous prime is 10707004219. The next prime is 10707004237. The reversal of 10707004224 is 42240070701.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-2 number, since 2×107070042242 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 430489 + ... + 454680.
Almost surely, 210707004224 is an apocalyptic number.
10707004224 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10707004224 is an abundant number, since it is smaller than the sum of its proper divisors (25266304576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10707004224 is an equidigital number, since it uses as much as digits as its factorization.
10707004224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 885197 (or 885181 counting only the distinct ones).
The product of its (nonzero) digits is 3136, while the sum is 27.
Adding to 10707004224 its reverse (42240070701), we get a palindrome (52947074925).
The spelling of 10707004224 in words is "ten billion, seven hundred seven million, four thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •