Base | Representation |
---|---|
bin | 1011101100110100110… |
… | …1011010100001110000 |
3 | 201012211211022011010012 |
4 | 2323031031122201300 |
5 | 11243132400411144 |
6 | 232202054354052 |
7 | 20344151132165 |
oct | 2731515324160 |
9 | 635754264105 |
10 | 201011341424 |
11 | 78280730a63 |
12 | 32b5a35b928 |
13 | 15c559ca65a |
14 | 9a2c54206c |
15 | 5367145e9e |
hex | 2ecd35a870 |
201011341424 has 20 divisors (see below), whose sum is σ = 389497492440. Its totient is φ = 100495859520.
The previous prime is 201011341411. The next prime is 201011341429. The reversal of 201011341424 is 424143110102.
201011341424 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 201011341424.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201011341429) 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 3 ways as a sum of consecutive naturals, for example, 442739 + ... + 773330.
It is an arithmetic number, because the mean of its divisors is an integer number (19474874622).
Almost surely, 2201011341424 is an apocalyptic number.
It is an amenable number.
201011341424 is a deficient number, since it is larger than the sum of its proper divisors (188486151016).
201011341424 is a wasteful number, since it uses less digits than its factorization.
201011341424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1226408 (or 1226402 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 201011341424 its reverse (424143110102), we get a palindrome (625154451526).
The spelling of 201011341424 in words is "two hundred one billion, eleven million, three hundred forty-one thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •