Base | Representation |
---|---|
bin | 1011101110010100001… |
… | …0011111010000100011 |
3 | 201020212200120112111102 |
4 | 2323211002133100203 |
5 | 11244442222133103 |
6 | 232305455305015 |
7 | 20360104234550 |
oct | 2734502372043 |
9 | 636780515442 |
10 | 201411130403 |
11 | 7846637237a |
12 | 3305021b16b |
13 | 15cba796b92 |
14 | 9a6968da27 |
15 | 538c2b6e88 |
hex | 2ee509f423 |
201411130403 has 8 divisors (see below), whose sum is σ = 230221620480. Its totient is φ = 172610008200.
The previous prime is 201411130379. The next prime is 201411130457. The reversal of 201411130403 is 304031114102.
201411130403 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201411130403 - 28 = 201411130147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201411130483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2295833 + ... + 2381946.
It is an arithmetic number, because the mean of its divisors is an integer number (28777702560).
Almost surely, 2201411130403 is an apocalyptic number.
201411130403 is a deficient number, since it is larger than the sum of its proper divisors (28810490077).
201411130403 is an equidigital number, since it uses as much as digits as its factorization.
201411130403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4683937.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 201411130403 its reverse (304031114102), we get a palindrome (505442244505).
The spelling of 201411130403 in words is "two hundred one billion, four hundred eleven million, one hundred thirty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •