Base | Representation |
---|---|
bin | 10111111001100110011111… |
… | …101010010100010010110011 |
3 | 111210011202002111120112000001 |
4 | 113321212133222110102303 |
5 | 102234134232301234043 |
6 | 1011320234020010431 |
7 | 31066123241120050 |
oct | 2771463752242263 |
9 | 453152074515001 |
10 | 105113413305523 |
11 | 305463915677a7 |
12 | b957825530a17 |
13 | 46861c990b1cc |
14 | 1bd5732c10027 |
15 | c24393abd74d |
hex | 5f999fa944b3 |
105113413305523 has 12 divisors (see below), whose sum is σ = 126784995553200. Its totient is φ = 85355252907696.
The previous prime is 105113413305521. The next prime is 105113413305529. The reversal of 105113413305523 is 325503314311501.
It is not a de Polignac number, because 105113413305523 - 21 = 105113413305521 is a prime.
It is a super-2 number, since 2×1051134133055232 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105113413305521) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 20798061048 + ... + 20798066101.
It is an arithmetic number, because the mean of its divisors is an integer number (10565416296100).
Almost surely, 2105113413305523 is an apocalyptic number.
105113413305523 is a deficient number, since it is larger than the sum of its proper divisors (21671582247677).
105113413305523 is an equidigital number, since it uses as much as digits as its factorization.
105113413305523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41596127194 (or 41596127175 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 37.
The spelling of 105113413305523 in words is "one hundred five trillion, one hundred thirteen billion, four hundred thirteen million, three hundred five thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •