Base | Representation |
---|---|
bin | 1011101101111110101… |
… | …1110110111111100111 |
3 | 201020122102120022010110 |
4 | 2323133223312333213 |
5 | 11244301223442411 |
6 | 232252530224103 |
7 | 20354633630154 |
oct | 2733753667747 |
9 | 636572508113 |
10 | 201321312231 |
11 | 7841a6a5686 |
12 | 33026125033 |
13 | 15ca4ca9930 |
14 | 9a5b78d22b |
15 | 53844742a6 |
hex | 2edfaf6fe7 |
201321312231 has 16 divisors (see below), whose sum is σ = 290105514720. Its totient is φ = 123449141760.
The previous prime is 201321312221. The next prime is 201321312251. The reversal of 201321312231 is 132213123102.
It is not a de Polignac number, because 201321312231 - 27 = 201321312103 is a prime.
It is a super-2 number, since 2×2013213122312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201321312198 and 201321312207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201321312221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9174246 + ... + 9196163.
It is an arithmetic number, because the mean of its divisors is an integer number (18131594670).
Almost surely, 2201321312231 is an apocalyptic number.
201321312231 is a deficient number, since it is larger than the sum of its proper divisors (88784202489).
201321312231 is a wasteful number, since it uses less digits than its factorization.
201321312231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18370706.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 201321312231 its reverse (132213123102), we get a palindrome (333534435333).
The spelling of 201321312231 in words is "two hundred one billion, three hundred twenty-one million, three hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •