Base | Representation |
---|---|
bin | 101110000001110010100010… |
… | …011010010100100101100101 |
3 | 222112202102021102120112212222 |
4 | 232001302202122110211211 |
5 | 203013131014042413013 |
6 | 1554312254300122125 |
7 | 60432211340105126 |
oct | 5601624232244545 |
9 | 875672242515788 |
10 | 202433123404133 |
11 | 59557450817296 |
12 | 1a854a8b536345 |
13 | 88c54916573ab |
14 | 37dbb5b84c04d |
15 | 1860b3b8ac508 |
hex | b81ca2694965 |
202433123404133 has 64 divisors (see below), whose sum is σ = 226864484121600. Its totient is φ = 179786379064320.
The previous prime is 202433123404117. The next prime is 202433123404151. The reversal of 202433123404133 is 331404321334202.
It is a cyclic number.
It is not a de Polignac number, because 202433123404133 - 24 = 202433123404117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202433123404093 and 202433123404102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202433123404153) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 35558248235 + ... + 35558253927.
It is an arithmetic number, because the mean of its divisors is an integer number (3544757564400).
Almost surely, 2202433123404133 is an apocalyptic number.
It is an amenable number.
202433123404133 is a deficient number, since it is larger than the sum of its proper divisors (24431360717467).
202433123404133 is a wasteful number, since it uses less digits than its factorization.
202433123404133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9102.
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 202433123404133 its reverse (331404321334202), we get a palindrome (533837444738335).
The spelling of 202433123404133 in words is "two hundred two trillion, four hundred thirty-three billion, one hundred twenty-three million, four hundred four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •