Base | Representation |
---|---|
bin | 101101110010110011001010… |
… | …111100001100101100110001 |
3 | 222102002221101010202210111220 |
4 | 231302303022330030230301 |
5 | 202344241331333103241 |
6 | 1552203133245055253 |
7 | 60264613241040426 |
oct | 5562631274145461 |
9 | 872087333683456 |
10 | 201403011222321 |
11 | 5919a5a02a6527 |
12 | 1a709304b57529 |
13 | 884c2b79a92bc |
14 | 37a3d5a117d4d |
15 | 1843e4b75d166 |
hex | b72ccaf0cb31 |
201403011222321 has 8 divisors (see below), whose sum is σ = 268628718620640. Its totient is φ = 134222988986112.
The previous prime is 201403011222317. The next prime is 201403011222383. The reversal of 201403011222321 is 123222110304102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201403011222321 - 22 = 201403011222317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201403011222291 and 201403011222300.
It is not an unprimeable number, because it can be changed into a prime (201403011222821) 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, 11421280240 + ... + 11421297873.
It is an arithmetic number, because the mean of its divisors is an integer number (33578589827580).
Almost surely, 2201403011222321 is an apocalyptic number.
It is an amenable number.
201403011222321 is a deficient number, since it is larger than the sum of its proper divisors (67225707398319).
201403011222321 is a wasteful number, since it uses less digits than its factorization.
201403011222321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22842581055.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 201403011222321 its reverse (123222110304102), we get a palindrome (324625121526423).
The spelling of 201403011222321 in words is "two hundred one trillion, four hundred three billion, eleven million, two hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •