Base | Representation |
---|---|
bin | 1001011111010110001010… |
… | …1011011111011011110111 |
3 | 1100221111022112112200022221 |
4 | 2113311202223133123313 |
5 | 2331423100032130403 |
6 | 34105212413503211 |
7 | 2124561332146252 |
oct | 227654253373367 |
9 | 40844275480287 |
10 | 10434131130103 |
11 | 33630aa00765a |
12 | 12062554a1b07 |
13 | 5a8c1b9a3325 |
14 | 28102c266099 |
15 | 131637e8ddbd |
hex | 97d62adf6f7 |
10434131130103 has 2 divisors, whose sum is σ = 10434131130104. Its totient is φ = 10434131130102.
The previous prime is 10434131130019. The next prime is 10434131130113. The reversal of 10434131130103 is 30103113143401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10434131130103 - 241 = 8235107874551 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10434131130113) 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, 5217065565051 + 5217065565052.
It is an arithmetic number, because the mean of its divisors is an integer number (5217065565052).
Almost surely, 210434131130103 is an apocalyptic number.
10434131130103 is a deficient number, since it is larger than the sum of its proper divisors (1).
10434131130103 is an equidigital number, since it uses as much as digits as its factorization.
10434131130103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 10434131130103 its reverse (30103113143401), we get a palindrome (40537244273504).
The spelling of 10434131130103 in words is "ten trillion, four hundred thirty-four billion, one hundred thirty-one million, one hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •