Base | Representation |
---|---|
bin | 101111111101101001… |
… | …1000101101101001101 |
3 | 100211212021022001120002 |
4 | 1133323103011231031 |
5 | 3141421041130013 |
6 | 115152342334045 |
7 | 10304305246265 |
oct | 1377323055515 |
9 | 324767261502 |
10 | 103000333133 |
11 | 3a756003865 |
12 | 17b6672a325 |
13 | 99362ac7a9 |
14 | 4db17127a5 |
15 | 2a2c847358 |
hex | 17fb4c5b4d |
103000333133 has 2 divisors, whose sum is σ = 103000333134. Its totient is φ = 103000333132.
The previous prime is 103000333129. The next prime is 103000333153. The reversal of 103000333133 is 331333000301.
It is an a-pointer prime, because the next prime (103000333153) can be obtained adding 103000333133 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82344319849 + 20656013284 = 286957^2 + 143722^2 .
It is a cyclic number.
It is not a de Polignac number, because 103000333133 - 22 = 103000333129 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103000333123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51500166566 + 51500166567.
It is an arithmetic number, because the mean of its divisors is an integer number (51500166567).
Almost surely, 2103000333133 is an apocalyptic number.
It is an amenable number.
103000333133 is a deficient number, since it is larger than the sum of its proper divisors (1).
103000333133 is an equidigital number, since it uses as much as digits as its factorization.
103000333133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 20.
Adding to 103000333133 its reverse (331333000301), we get a palindrome (434333333434).
The spelling of 103000333133 in words is "one hundred three billion, three hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •