Base | Representation |
---|---|
bin | 110000111011100110… |
… | …0001010100111111111 |
3 | 101001020010110211201220 |
4 | 1201313030022213333 |
5 | 3210200144034210 |
6 | 120134513204423 |
7 | 10406644565613 |
oct | 1416714124777 |
9 | 331203424656 |
10 | 105078893055 |
11 | 40622328684 |
12 | 18446860713 |
13 | 9ba7b018c6 |
14 | 512b7bb343 |
15 | 2b00076c70 |
hex | 187730a9ff |
105078893055 has 16 divisors (see below), whose sum is σ = 168860410080. Its totient is φ = 55797349248.
The previous prime is 105078893053. The next prime is 105078893057. The reversal of 105078893055 is 550398870501.
It is an interprime number because it is at equal distance from previous prime (105078893053) and next prime (105078893057).
It is not a de Polignac number, because 105078893055 - 21 = 105078893053 is a prime.
It is a super-2 number, since 2×1050788930552 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105078892989 and 105078893007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105078893053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15291892 + ... + 15298761.
It is an arithmetic number, because the mean of its divisors is an integer number (10553775630).
Almost surely, 2105078893055 is an apocalyptic number.
105078893055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105078893055 is a deficient number, since it is larger than the sum of its proper divisors (63781517025).
105078893055 is a wasteful number, since it uses less digits than its factorization.
105078893055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30590890.
The product of its (nonzero) digits is 1512000, while the sum is 51.
The spelling of 105078893055 in words is "one hundred five billion, seventy-eight million, eight hundred ninety-three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •