Base | Representation |
---|---|
bin | 1011101101111110111… |
… | …0100110110001100111 |
3 | 201020122110220212210010 |
4 | 2323133232212301213 |
5 | 11244301420012411 |
6 | 232252553501303 |
7 | 20354643016245 |
oct | 2733756466147 |
9 | 636573825703 |
10 | 201322032231 |
11 | 78420047621 |
12 | 33026411833 |
13 | 15ca519c578 |
14 | 9a5b8d9795 |
15 | 53845677a6 |
hex | 2edfba6c67 |
201322032231 has 8 divisors (see below), whose sum is σ = 268462454400. Its totient is φ = 134198149112.
The previous prime is 201322032221. The next prime is 201322032367. The reversal of 201322032231 is 132230223102.
It is a happy number.
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 201322032231 - 26 = 201322032167 is a prime.
It is a super-2 number, since 2×2013220322312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201322032198 and 201322032207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201322032221) 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, 4106331 + ... + 4155068.
It is an arithmetic number, because the mean of its divisors is an integer number (33557806800).
Almost surely, 2201322032231 is an apocalyptic number.
201322032231 is a deficient number, since it is larger than the sum of its proper divisors (67140422169).
201322032231 is an equidigital number, since it uses as much as digits as its factorization.
201322032231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8269525.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 201322032231 its reverse (132230223102), we get a palindrome (333552255333).
The spelling of 201322032231 in words is "two hundred one billion, three hundred twenty-two million, thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •