Base | Representation |
---|---|
bin | 10111111001110110111001… |
… | …101110001100110001100111 |
3 | 111210020102120021020122112111 |
4 | 113321312321232030301213 |
5 | 102234431322240300403 |
6 | 1011332310103301451 |
7 | 31100315640005611 |
oct | 2771667156146147 |
9 | 453212507218474 |
10 | 105131030400103 |
11 | 3055290199a6a4 |
12 | b95b12144a887 |
13 | 4687a76704026 |
14 | 1bd6524845db1 |
15 | c24a7553d56d |
hex | 5f9db9b8cc67 |
105131030400103 has 2 divisors, whose sum is σ = 105131030400104. Its totient is φ = 105131030400102.
The previous prime is 105131030400043. The next prime is 105131030400119. The reversal of 105131030400103 is 301004030131501.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105131030400103 is a prime.
It is a super-2 number, since 2×1051310304001032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105131030400163) 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 as a sum of consecutive naturals, namely, 52565515200051 + 52565515200052.
It is an arithmetic number, because the mean of its divisors is an integer number (52565515200052).
Almost surely, 2105131030400103 is an apocalyptic number.
105131030400103 is a deficient number, since it is larger than the sum of its proper divisors (1).
105131030400103 is an equidigital number, since it uses as much as digits as its factorization.
105131030400103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 105131030400103 its reverse (301004030131501), we get a palindrome (406135060531604).
The spelling of 105131030400103 in words is "one hundred five trillion, one hundred thirty-one billion, thirty million, four hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •