Base | Representation |
---|---|
bin | 101101101101000110001011… |
… | …001110010111101011011011 |
3 | 222100201110210012002002110021 |
4 | 231231012023032113223123 |
5 | 202321331213124020443 |
6 | 1551303120304131311 |
7 | 60224400310346404 |
oct | 5555061316275333 |
9 | 870643705062407 |
10 | 201011100220123 |
11 | 590593687a8986 |
12 | 1a66536a906b37 |
13 | 882135b171abb |
14 | 378cdbc3889ab |
15 | 1838b6008e9ed |
hex | b6d18b397adb |
201011100220123 has 8 divisors (see below), whose sum is σ = 201463313335200. Its totient is φ = 200558907225600.
The previous prime is 201011100220103. The next prime is 201011100220187. The reversal of 201011100220123 is 321022001110102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201011100220123 - 213 = 201011100211931 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201011100220097 and 201011100220106.
It is not an unprimeable number, because it can be changed into a prime (201011100220103) 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, 15063186 + ... + 25078312.
It is an arithmetic number, because the mean of its divisors is an integer number (25182914166900).
Almost surely, 2201011100220123 is an apocalyptic number.
201011100220123 is a deficient number, since it is larger than the sum of its proper divisors (452213115077).
201011100220123 is a wasteful number, since it uses less digits than its factorization.
201011100220123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10060277.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 201011100220123 its reverse (321022001110102), we get a palindrome (522033101330225).
The spelling of 201011100220123 in words is "two hundred one trillion, eleven billion, one hundred million, two hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.038 sec. • engine limits •