Base | Representation |
---|---|
bin | 11000000010010111101111… |
… | …111101010010011100000111 |
3 | 111212022100121200220010121010 |
4 | 120002113233331102130013 |
5 | 102324022440301034013 |
6 | 1012501141405453303 |
7 | 31160506262345160 |
oct | 3002275775223407 |
9 | 455270550803533 |
10 | 105716055877383 |
11 | 30758a22592686 |
12 | ba34591271233 |
13 | 46cac9ab959b3 |
14 | 1c16982018767 |
15 | c34db592a7c3 |
hex | 6025eff52707 |
105716055877383 has 64 divisors (see below), whose sum is σ = 174539522691072. Its totient is φ = 55531634296320.
The previous prime is 105716055877363. The next prime is 105716055877403. The reversal of 105716055877383 is 383778550617501.
It is an interprime number because it is at equal distance from previous prime (105716055877363) and next prime (105716055877403).
It is not a de Polignac number, because 105716055877383 - 214 = 105716055860999 is a prime.
It is a super-2 number, since 2×1057160558773832 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105716055877363) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 551972268 + ... + 552163758.
It is an arithmetic number, because the mean of its divisors is an integer number (2727180042048).
Almost surely, 2105716055877383 is an apocalyptic number.
105716055877383 is a deficient number, since it is larger than the sum of its proper divisors (68823466813689).
105716055877383 is a wasteful number, since it uses less digits than its factorization.
105716055877383 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227524.
The product of its (nonzero) digits is 148176000, while the sum is 66.
The spelling of 105716055877383 in words is "one hundred five trillion, seven hundred sixteen billion, fifty-five million, eight hundred seventy-seven thousand, three hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •