Base | Representation |
---|---|
bin | 101110101101100100… |
… | …0001111010000110101 |
3 | 100120220222212012112012 |
4 | 1131123020033100311 |
5 | 3120420130243013 |
6 | 114025550334005 |
7 | 10150565400002 |
oct | 1353310172065 |
9 | 316828765465 |
10 | 100313134133 |
11 | 395a7170443 |
12 | 175367ba305 |
13 | 95c8658804 |
14 | 4bd88928a9 |
15 | 29219901a8 |
hex | 175b20f435 |
100313134133 has 2 divisors, whose sum is σ = 100313134134. Its totient is φ = 100313134132.
The previous prime is 100313134127. The next prime is 100313134151. The reversal of 100313134133 is 331431313001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100296989809 + 16144324 = 316697^2 + 4018^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100313134133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100313134099 and 100313134108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100313134123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50156567066 + 50156567067.
It is an arithmetic number, because the mean of its divisors is an integer number (50156567067).
Almost surely, 2100313134133 is an apocalyptic number.
It is an amenable number.
100313134133 is a deficient number, since it is larger than the sum of its proper divisors (1).
100313134133 is an equidigital number, since it uses as much as digits as its factorization.
100313134133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 100313134133 its reverse (331431313001), we get a palindrome (431744447134).
The spelling of 100313134133 in words is "one hundred billion, three hundred thirteen million, one hundred thirty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •