Base | Representation |
---|---|
bin | 101101101101001000000011… |
… | …101100001011111001101011 |
3 | 222100201200000001002200202011 |
4 | 231231020003230023321223 |
5 | 202321344333023131443 |
6 | 1551304053023020351 |
7 | 60224501351304634 |
oct | 5555100354137153 |
9 | 870650001080664 |
10 | 201013121302123 |
11 | 5905a205634789 |
12 | 1a66583373a6b7 |
13 | 88215c0abac00 |
14 | 378d13097088b |
15 | 1838c2c718b9d |
hex | b6d203b0be6b |
201013121302123 has 12 divisors (see below), whose sum is σ = 219699349099848. Its totient is φ = 183816455983680.
The previous prime is 201013121302121. The next prime is 201013121302153. The reversal of 201013121302123 is 321203121310102.
It is not a de Polignac number, because 201013121302123 - 21 = 201013121302121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201013121302094 and 201013121302103.
It is not an unprimeable number, because it can be changed into a prime (201013121302121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5558050858 + ... + 5558087023.
It is an arithmetic number, because the mean of its divisors is an integer number (18308279091654).
Almost surely, 2201013121302123 is an apocalyptic number.
201013121302123 is a deficient number, since it is larger than the sum of its proper divisors (18686227797725).
201013121302123 is a wasteful number, since it uses less digits than its factorization.
201013121302123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11116138014 (or 11116138001 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 201013121302123 its reverse (321203121310102), we get a palindrome (522216242612225).
The spelling of 201013121302123 in words is "two hundred one trillion, thirteen billion, one hundred twenty-one million, three hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •