Base | Representation |
---|---|
bin | 1101100100000000000… |
… | …0011110010111110101 |
3 | 211021102022120002011022 |
4 | 3121000000132113311 |
5 | 12304142014201323 |
6 | 255012323350525 |
7 | 22556003113421 |
oct | 3310000362765 |
9 | 737368502138 |
10 | 233002100213 |
11 | 8a8a767a593 |
12 | 391a7b22445 |
13 | 18c8365271c |
14 | b3c511bb81 |
15 | 60da9094c8 |
hex | 364001e5f5 |
233002100213 has 2 divisors, whose sum is σ = 233002100214. Its totient is φ = 233002100212.
The previous prime is 233002100203. The next prime is 233002100237. The reversal of 233002100213 is 312001200332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119205848644 + 113796251569 = 345262^2 + 337337^2 .
It is a cyclic number.
It is not a de Polignac number, because 233002100213 - 24 = 233002100197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 233002100191 and 233002100200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (233002100203) 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, 116501050106 + 116501050107.
It is an arithmetic number, because the mean of its divisors is an integer number (116501050107).
Almost surely, 2233002100213 is an apocalyptic number.
It is an amenable number.
233002100213 is a deficient number, since it is larger than the sum of its proper divisors (1).
233002100213 is an equidigital number, since it uses as much as digits as its factorization.
233002100213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 233002100213 its reverse (312001200332), we get a palindrome (545003300545).
The spelling of 233002100213 in words is "two hundred thirty-three billion, two million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •