Base | Representation |
---|---|
bin | 101110100101001110… |
… | …0011011000111011101 |
3 | 100120012111010201202212 |
4 | 1131022130123013131 |
5 | 3114332000303033 |
6 | 113542110530205 |
7 | 10140626165045 |
oct | 1351234330735 |
9 | 316174121685 |
10 | 100033212893 |
11 | 39473160479 |
12 | 17478b06965 |
13 | 958266ac43 |
14 | 4bad628725 |
15 | 29070ea748 |
hex | 174a71b1dd |
100033212893 has 2 divisors, whose sum is σ = 100033212894. Its totient is φ = 100033212892.
The previous prime is 100033212889. The next prime is 100033212899. The reversal of 100033212893 is 398212330001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99687327289 + 345885604 = 315733^2 + 18598^2 .
It is an emirp because it is prime and its reverse (398212330001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100033212893 - 22 = 100033212889 is a prime.
It is a super-2 number, since 2×1000332128932 (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 (100033212899) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50016606446 + 50016606447.
It is an arithmetic number, because the mean of its divisors is an integer number (50016606447).
Almost surely, 2100033212893 is an apocalyptic number.
It is an amenable number.
100033212893 is a deficient number, since it is larger than the sum of its proper divisors (1).
100033212893 is an equidigital number, since it uses as much as digits as its factorization.
100033212893 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 32.
Adding to 100033212893 its reverse (398212330001), we get a palindrome (498245542894).
The spelling of 100033212893 in words is "one hundred billion, thirty-three million, two hundred twelve thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •