Base | Representation |
---|---|
bin | 10011110100100001… |
… | …01001111010010000 |
3 | 1000110121010221200100 |
4 | 21322100221322100 |
5 | 133243111332122 |
6 | 4515524052400 |
7 | 524461015062 |
oct | 117220517220 |
9 | 30417127610 |
10 | 10641120912 |
11 | 45706a9704 |
12 | 208b834100 |
13 | 1007782b66 |
14 | 72d371732 |
15 | 4242eeaac |
hex | 27a429e90 |
10641120912 has 30 divisors (see below), whose sum is σ = 29780359622. Its totient is φ = 3547040256.
The previous prime is 10641120911. The next prime is 10641120949. The reversal of 10641120912 is 21902114601.
10641120912 is a `hidden beast` number, since 1 + 0 + 641 + 1 + 2 + 0 + 9 + 12 = 666.
It can be written as a sum of positive squares in only one way, i.e., 6644858256 + 3996262656 = 81516^2 + 63216^2 .
It is a super-2 number, since 2×106411209122 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10641120911) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 36948193 + ... + 36948480.
Almost surely, 210641120912 is an apocalyptic number.
10641120912 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10641120912 is an abundant number, since it is smaller than the sum of its proper divisors (19139238710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10641120912 is a wasteful number, since it uses less digits than its factorization.
10641120912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73896687 (or 73896678 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The spelling of 10641120912 in words is "ten billion, six hundred forty-one million, one hundred twenty thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •