Base | Representation |
---|---|
bin | 1011101110010110010… |
… | …0110000000010001101 |
3 | 201020220022110211221122 |
4 | 2323211210300002031 |
5 | 11300002022041023 |
6 | 232310420010325 |
7 | 20360243463161 |
oct | 2734544600215 |
9 | 636808424848 |
10 | 201420112013 |
11 | 7847044739a |
12 | 330532309a5 |
13 | 15cbc5c0043 |
14 | 9a6a94aca1 |
15 | 538ce8d2c8 |
hex | 2ee593008d |
201420112013 has 8 divisors (see below), whose sum is σ = 212141740800. Its totient is φ = 190710540288.
The previous prime is 201420111983. The next prime is 201420112027. The reversal of 201420112013 is 310211024102.
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 201420112013 - 214 = 201420095629 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201420111982 and 201420112000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201420112073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2979956 + ... + 3046797.
It is an arithmetic number, because the mean of its divisors is an integer number (26517717600).
Almost surely, 2201420112013 is an apocalyptic number.
It is an amenable number.
201420112013 is a deficient number, since it is larger than the sum of its proper divisors (10721628787).
201420112013 is a wasteful number, since it uses less digits than its factorization.
201420112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6028531.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 201420112013 its reverse (310211024102), we get a palindrome (511631136115).
The spelling of 201420112013 in words is "two hundred one billion, four hundred twenty million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •