Base | Representation |
---|---|
bin | 110000111011011001… |
… | …0010001011100000000 |
3 | 101001012122200222120110 |
4 | 1201312302101130000 |
5 | 3210141424331331 |
6 | 120134111511320 |
7 | 10406533105161 |
oct | 1416662213400 |
9 | 331178628513 |
10 | 105072105216 |
11 | 406195118a1 |
12 | 18444528540 |
13 | 9ba6596130 |
14 | 512a931768 |
15 | 2aee685946 |
hex | 1876c91700 |
105072105216 has 72 divisors (see below), whose sum is σ = 301156214800. Its totient is φ = 32329875456.
The previous prime is 105072105167. The next prime is 105072105239. The reversal of 105072105216 is 612501270501.
105072105216 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1050721052162 (a number of 23 digits) contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5252041 + ... + 5272008.
Almost surely, 2105072105216 is an apocalyptic number.
105072105216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
105072105216 is an abundant number, since it is smaller than the sum of its proper divisors (196084109584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105072105216 is a wasteful number, since it uses less digits than its factorization.
105072105216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10524081 (or 10524067 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 30.
Adding to 105072105216 its reverse (612501270501), we get a palindrome (717573375717).
The spelling of 105072105216 in words is "one hundred five billion, seventy-two million, one hundred five thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •