Base | Representation |
---|---|
bin | 10111111001110110111001… |
… | …101110001100110000001011 |
3 | 111210020102120021020122102002 |
4 | 113321312321232030300023 |
5 | 102234431322240300021 |
6 | 1011332310103301215 |
7 | 31100315640005420 |
oct | 2771667156146013 |
9 | 453212507218362 |
10 | 105131030400011 |
11 | 3055290199a620 |
12 | b95b12144a80b |
13 | 4687a76703c85 |
14 | 1bd6524845d47 |
15 | c24a7553d50b |
hex | 5f9db9b8cc0b |
105131030400011 has 32 divisors (see below), whose sum is σ = 135968954849280. Its totient is φ = 78910553779200.
The previous prime is 105131030399987. The next prime is 105131030400043. The reversal of 105131030400011 is 110004030131501.
It is not a de Polignac number, because 105131030400011 - 222 = 105131026205707 is a prime.
It is a super-2 number, since 2×1051310304000112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105131030400511) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 210515966 + ... + 211014771.
It is an arithmetic number, because the mean of its divisors is an integer number (4249029839040).
Almost surely, 2105131030400011 is an apocalyptic number.
105131030400011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
105131030400011 is a deficient number, since it is larger than the sum of its proper divisors (30837924449269).
105131030400011 is a wasteful number, since it uses less digits than its factorization.
105131030400011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421530875.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 105131030400011 its reverse (110004030131501), we get a palindrome (215135060531512).
The spelling of 105131030400011 in words is "one hundred five trillion, one hundred thirty-one billion, thirty million, four hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •