Base | Representation |
---|---|
bin | 101101100001011100001100… |
… | …101011111000001100110111 |
3 | 222020212220022000221020111112 |
4 | 231201130030223320030313 |
5 | 202220220303003111043 |
6 | 1545451131211225235 |
7 | 60112463151213524 |
oct | 5541341453701467 |
9 | 866786260836445 |
10 | 200210113332023 |
11 | 5887a6a5566593 |
12 | 1a556089a4821b |
13 | 879396a8c9392 |
14 | 3762314d2a14b |
15 | 1822dd030b518 |
hex | b6170caf8337 |
200210113332023 has 48 divisors (see below), whose sum is σ = 220956454221120. Its totient is φ = 180732744192000.
The previous prime is 200210113332011. The next prime is 200210113332041. The reversal of 200210113332023 is 320233311012002.
It is not a de Polignac number, because 200210113332023 - 216 = 200210113266487 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200210113332023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210113382023) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3606646838 + ... + 3606702348.
It is an arithmetic number, because the mean of its divisors is an integer number (4603259462940).
Almost surely, 2200210113332023 is an apocalyptic number.
200210113332023 is a deficient number, since it is larger than the sum of its proper divisors (20746340889097).
200210113332023 is a wasteful number, since it uses less digits than its factorization.
200210113332023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57740 (or 57699 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 200210113332023 its reverse (320233311012002), we get a palindrome (520443424344025).
The spelling of 200210113332023 in words is "two hundred trillion, two hundred ten billion, one hundred thirteen million, three hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •