Base | Representation |
---|---|
bin | 101101100001011100010001… |
… | …111010011000011001110111 |
3 | 222020212220112010221020211020 |
4 | 231201130101322120121313 |
5 | 202220220442430120043 |
6 | 1545451144022512223 |
7 | 60112465264436625 |
oct | 5541342172303167 |
9 | 866786463836736 |
10 | 200210201020023 |
11 | 5887a740008907 |
12 | 1a5560b3295673 |
13 | 8793982b1bb7c |
14 | 3762322834515 |
15 | 1822dd7d7ce83 |
hex | b61711e98677 |
200210201020023 has 8 divisors (see below), whose sum is σ = 267716234218368. Its totient is φ = 133088817584184.
The previous prime is 200210201020019. The next prime is 200210201020061. The reversal of 200210201020023 is 320020102012002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200210201020023 - 22 = 200210201020019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200210201019984 and 200210201020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210201020013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96162439411 + ... + 96162441492.
It is an arithmetic number, because the mean of its divisors is an integer number (33464529277296).
Almost surely, 2200210201020023 is an apocalyptic number.
200210201020023 is a deficient number, since it is larger than the sum of its proper divisors (67506033198345).
200210201020023 is a wasteful number, since it uses less digits than its factorization.
200210201020023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192324881253.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 200210201020023 its reverse (320020102012002), we get a palindrome (520230303032025).
The spelling of 200210201020023 in words is "two hundred trillion, two hundred ten billion, two hundred one million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •