Base | Representation |
---|---|
bin | 101101011111111111000100… |
… | …101000010110101100111111 |
3 | 222020112100012100012212202020 |
4 | 231133333010220112230333 |
5 | 202212101011232413043 |
6 | 1545333153051331223 |
7 | 60102323216504334 |
oct | 5537770450265477 |
9 | 866470170185666 |
10 | 200110120201023 |
11 | 58841252aa224a |
12 | 1a53a822450b13 |
13 | 87873c3653346 |
14 | 375b54ab7698b |
15 | 18204cb9cbe83 |
hex | b5ffc4a16b3f |
200110120201023 has 8 divisors (see below), whose sum is σ = 266823192846000. Its totient is φ = 133401897178368.
The previous prime is 200110120200983. The next prime is 200110120201031. The reversal of 200110120201023 is 320102021011002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200110120201023 - 216 = 200110120135487 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200110120200993 and 200110120201011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200110120201093) 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, 1212309298 + ... + 1212474351.
It is an arithmetic number, because the mean of its divisors is an integer number (33352899105750).
Almost surely, 2200110120201023 is an apocalyptic number.
200110120201023 is a deficient number, since it is larger than the sum of its proper divisors (66713072644977).
200110120201023 is a wasteful number, since it uses less digits than its factorization.
200110120201023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2424811161.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 200110120201023 its reverse (320102021011002), we get a palindrome (520212141212025).
The spelling of 200110120201023 in words is "two hundred trillion, one hundred ten billion, one hundred twenty million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •