Base | Representation |
---|---|
bin | 10110110001001000001000… |
… | …000000111011011110111001 |
3 | 111010112121210002001012011022 |
4 | 112301020020000323132321 |
5 | 101111034342003002223 |
6 | 552544244401112225 |
7 | 30043241064403142 |
oct | 2661101000733671 |
9 | 433477702035138 |
10 | 100133002000313 |
11 | 299a61931925a7 |
12 | b292543928675 |
13 | 43b4669c52609 |
14 | 1aa266ac84ac9 |
15 | b89a50e6eac8 |
hex | 5b120803b7b9 |
100133002000313 has 2 divisors, whose sum is σ = 100133002000314. Its totient is φ = 100133002000312.
The previous prime is 100133002000309. The next prime is 100133002000319. The reversal of 100133002000313 is 313000200331001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94877184402064 + 5255817598249 = 9740492^2 + 2292557^2 .
It is a cyclic number.
It is not a de Polignac number, because 100133002000313 - 22 = 100133002000309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100133002000291 and 100133002000300.
It is not a weakly prime, because it can be changed into another prime (100133002000319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50066501000156 + 50066501000157.
It is an arithmetic number, because the mean of its divisors is an integer number (50066501000157).
Almost surely, 2100133002000313 is an apocalyptic number.
It is an amenable number.
100133002000313 is a deficient number, since it is larger than the sum of its proper divisors (1).
100133002000313 is an equidigital number, since it uses as much as digits as its factorization.
100133002000313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 100133002000313 its reverse (313000200331001), we get a palindrome (413133202331314).
The spelling of 100133002000313 in words is "one hundred trillion, one hundred thirty-three billion, two million, three hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •