Base | Representation |
---|---|
bin | 1011101101111110101… |
… | …1000011001011111111 |
3 | 201020122102011112001012 |
4 | 2323133223003023333 |
5 | 11244301200200111 |
6 | 232252521505435 |
7 | 20354632054412 |
oct | 2733753031377 |
9 | 636572145035 |
10 | 201321100031 |
11 | 7841a570207 |
12 | 3302604227b |
13 | 15ca4c3417c |
14 | 9a5b735b79 |
15 | 538443148b |
hex | 2edfac32ff |
201321100031 has 4 divisors (see below), whose sum is σ = 201823148064. Its totient is φ = 200819052000.
The previous prime is 201321100027. The next prime is 201321100069. The reversal of 201321100031 is 130001123102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201321100031 - 22 = 201321100027 is a prime.
It is a super-2 number, since 2×2013211000312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201321099979 and 201321100015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201321100831) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 251023415 + ... + 251024216.
It is an arithmetic number, because the mean of its divisors is an integer number (50455787016).
Almost surely, 2201321100031 is an apocalyptic number.
201321100031 is a deficient number, since it is larger than the sum of its proper divisors (502048033).
201321100031 is an equidigital number, since it uses as much as digits as its factorization.
201321100031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 502048032.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 201321100031 its reverse (130001123102), we get a palindrome (331322223133).
The spelling of 201321100031 in words is "two hundred one billion, three hundred twenty-one million, one hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •