Base | Representation |
---|---|
bin | 101101101100111011111100… |
… | …111000001101010010010011 |
3 | 222100200102110002211101000122 |
4 | 231230323330320031102103 |
5 | 202321141222230023443 |
6 | 1551254103101140455 |
7 | 60223531255066616 |
oct | 5554737470152223 |
9 | 870612402741018 |
10 | 201000122111123 |
11 | 59054744962125 |
12 | 1a66320625a72b |
13 | 88202cb94050a |
14 | 378c65a37617d |
15 | 183871b3c6968 |
hex | b6cefce0d493 |
201000122111123 has 8 divisors (see below), whose sum is σ = 211455417769200. Its totient is φ = 190779776917408.
The previous prime is 201000122111081. The next prime is 201000122111179. The reversal of 201000122111123 is 321111221000102.
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 201000122111123 - 28 = 201000122110867 is a prime.
It is a super-2 number, since 2×2010001221111232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201000122911123) 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, 58737614336 + ... + 58737617757.
It is an arithmetic number, because the mean of its divisors is an integer number (26431927221150).
Almost surely, 2201000122111123 is an apocalyptic number.
201000122111123 is a deficient number, since it is larger than the sum of its proper divisors (10455295658077).
201000122111123 is a wasteful number, since it uses less digits than its factorization.
201000122111123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117475232181.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 201000122111123 its reverse (321111221000102), we get a palindrome (522111343111225).
The spelling of 201000122111123 in words is "two hundred one trillion, one hundred twenty-two million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •