Base | Representation |
---|---|
bin | 101110101000001001… |
… | …0100110011111000001 |
3 | 100120110022201010210022 |
4 | 1131100102212133001 |
5 | 3120032103120223 |
6 | 113555533143225 |
7 | 10143230006111 |
oct | 1352022463701 |
9 | 316408633708 |
10 | 100131301313 |
11 | 3951356678a |
12 | 174a592ab15 |
13 | 9599a92624 |
14 | 4bbc67d041 |
15 | 2910a23ac8 |
hex | 17504a67c1 |
100131301313 has 2 divisors, whose sum is σ = 100131301314. Its totient is φ = 100131301312.
The previous prime is 100131301279. The next prime is 100131301337. The reversal of 100131301313 is 313103131001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63394679089 + 36736622224 = 251783^2 + 191668^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100131301313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100131301291 and 100131301300.
It is not a weakly prime, because it can be changed into another prime (100131301373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50065650656 + 50065650657.
It is an arithmetic number, because the mean of its divisors is an integer number (50065650657).
Almost surely, 2100131301313 is an apocalyptic number.
It is an amenable number.
100131301313 is a deficient number, since it is larger than the sum of its proper divisors (1).
100131301313 is an equidigital number, since it uses as much as digits as its factorization.
100131301313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 100131301313 its reverse (313103131001), we get a palindrome (413234432314).
The spelling of 100131301313 in words is "one hundred billion, one hundred thirty-one million, three hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •