Base | Representation |
---|---|
bin | 101101101100111101000100… |
… | …011110011010110000101011 |
3 | 222100200112112211002121021111 |
4 | 231230331010132122300223 |
5 | 202321201202231410443 |
6 | 1551254422211051151 |
7 | 60223603112110540 |
oct | 5554750436326053 |
9 | 870615484077244 |
10 | 201001323310123 |
11 | 59055200a07776 |
12 | 1a6634a05a0ab7 |
13 | 882046076465b |
14 | 378c731ad8bc7 |
15 | 183878ba9c69d |
hex | b6cf4479ac2b |
201001323310123 has 8 divisors (see below), whose sum is σ = 229717780449248. Its totient is φ = 172285361766144.
The previous prime is 201001323310079. The next prime is 201001323310159. The reversal of 201001323310123 is 321013323100102.
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 201001323310123 - 237 = 200863884356651 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201001323310094 and 201001323310103.
It is not an unprimeable number, because it can be changed into a prime (201001323310223) 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, 123029286 + ... + 124652347.
It is an arithmetic number, because the mean of its divisors is an integer number (28714722556156).
Almost surely, 2201001323310123 is an apocalyptic number.
201001323310123 is a deficient number, since it is larger than the sum of its proper divisors (28716457139125).
201001323310123 is a wasteful number, since it uses less digits than its factorization.
201001323310123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247797573.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 201001323310123 its reverse (321013323100102), we get a palindrome (522014646410225).
The spelling of 201001323310123 in words is "two hundred one trillion, one billion, three hundred twenty-three million, three hundred ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •