Base | Representation |
---|---|
bin | 101110101110000100… |
… | …1000000110100011101 |
3 | 100120222011210212222111 |
4 | 1131130021000310131 |
5 | 3120434002124313 |
6 | 114031354314021 |
7 | 10151162620651 |
oct | 1353411006435 |
9 | 316864725874 |
10 | 100330114333 |
11 | 39605808969 |
12 | 17540428911 |
13 | 95cc022577 |
14 | 4bdac32a61 |
15 | 29231e643d |
hex | 175c240d1d |
100330114333 has 2 divisors, whose sum is σ = 100330114334. Its totient is φ = 100330114332.
The previous prime is 100330114279. The next prime is 100330114349. The reversal of 100330114333 is 333411033001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91036768729 + 9293345604 = 301723^2 + 96402^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100330114333 is a prime.
It is a super-2 number, since 2×1003301143332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100330114363) 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, 50165057166 + 50165057167.
It is an arithmetic number, because the mean of its divisors is an integer number (50165057167).
Almost surely, 2100330114333 is an apocalyptic number.
It is an amenable number.
100330114333 is a deficient number, since it is larger than the sum of its proper divisors (1).
100330114333 is an equidigital number, since it uses as much as digits as its factorization.
100330114333 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 22.
Adding to 100330114333 its reverse (333411033001), we get a palindrome (433741147334).
The spelling of 100330114333 in words is "one hundred billion, three hundred thirty million, one hundred fourteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •