Base | Representation |
---|---|
bin | 101101110001101111010001… |
… | …101101010011001101101001 |
3 | 222101211222012112211220121020 |
4 | 231301233101231103031221 |
5 | 202342043031220011241 |
6 | 1552105435325403053 |
7 | 60256422550403223 |
oct | 5561572155231551 |
9 | 871758175756536 |
10 | 201330110313321 |
11 | 59171690674600 |
12 | 1a6b715a709489 |
13 | 884546a563262 |
14 | 37a0602131413 |
15 | 18420d162db66 |
hex | b71bd1b53369 |
201330110313321 has 24 divisors (see below), whose sum is σ = 295063276146240. Its totient is φ = 122017849319520.
The previous prime is 201330110313259. The next prime is 201330110313331. The reversal of 201330110313321 is 123313011033102.
It is not a de Polignac number, because 201330110313321 - 226 = 201330043204457 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201330110313291 and 201330110313300.
It is not an unprimeable number, because it can be changed into a prime (201330110313331) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 140429535 + ... + 141855963.
It is an arithmetic number, because the mean of its divisors is an integer number (12294303172760).
Almost surely, 2201330110313321 is an apocalyptic number.
It is an amenable number.
201330110313321 is a deficient number, since it is larger than the sum of its proper divisors (93733165832919).
201330110313321 is a wasteful number, since it uses less digits than its factorization.
201330110313321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1815277 (or 1815266 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 201330110313321 its reverse (123313011033102), we get a palindrome (324643121346423).
The spelling of 201330110313321 in words is "two hundred one trillion, three hundred thirty billion, one hundred ten million, three hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •