Base | Representation |
---|---|
bin | 10111111101011011100101… |
… | …001111110110010010000111 |
3 | 111211002220100121102121002222 |
4 | 113331123211033312102013 |
5 | 102302442210341331111 |
6 | 1012041155114122555 |
7 | 31124130506166314 |
oct | 2775334517662207 |
9 | 454086317377088 |
10 | 105376573777031 |
11 | 30637a5480aa87 |
12 | b99a82942045b |
13 | 46a4c7839603b |
14 | 1c043793ddd0b |
15 | c2b146e867db |
hex | 5fd6e53f6487 |
105376573777031 has 16 divisors (see below), whose sum is σ = 110950536556800. Its totient is φ = 99805396752000.
The previous prime is 105376573776973. The next prime is 105376573777049. The reversal of 105376573777031 is 130777375673501.
It is a cyclic number.
It is not a de Polignac number, because 105376573777031 - 230 = 105375500035207 is a prime.
It is a super-2 number, since 2×1053765737770312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105376573777051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1661823455 + ... + 1661886863.
It is an arithmetic number, because the mean of its divisors is an integer number (6934408534800).
Almost surely, 2105376573777031 is an apocalyptic number.
105376573777031 is a deficient number, since it is larger than the sum of its proper divisors (5573962779769).
105376573777031 is a wasteful number, since it uses less digits than its factorization.
105376573777031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83990.
The product of its (nonzero) digits is 68068350, while the sum is 62.
The spelling of 105376573777031 in words is "one hundred five trillion, three hundred seventy-six billion, five hundred seventy-three million, seven hundred seventy-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •