Base | Representation |
---|---|
bin | 1011101110010110100… |
… | …1000001110010100000 |
3 | 201020220101120211002020 |
4 | 2323211221001302200 |
5 | 11300002313431222 |
6 | 232310500021440 |
7 | 20360256143235 |
oct | 2734551016240 |
9 | 636811524066 |
10 | 201421233312 |
11 | 78471042892 |
12 | 33053691880 |
13 | 15cbc8c3530 |
14 | 9a6ab5d78c |
15 | 538d11065c |
hex | 2ee5a41ca0 |
201421233312 has 96 divisors (see below), whose sum is σ = 569564835840. Its totient is φ = 61958077440.
The previous prime is 201421233271. The next prime is 201421233313. The reversal of 201421233312 is 213332124102.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (201421233313) 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 15 ways as a sum of consecutive naturals, for example, 4747489 + ... + 4789727.
It is an arithmetic number, because the mean of its divisors is an integer number (5932967040).
Almost surely, 2201421233312 is an apocalyptic number.
It is an amenable number.
201421233312 is an abundant number, since it is smaller than the sum of its proper divisors (368143602528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201421233312 is a wasteful number, since it uses less digits than its factorization.
201421233312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46086 (or 46078 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 201421233312 its reverse (213332124102), we get a palindrome (414753357414).
The spelling of 201421233312 in words is "two hundred one billion, four hundred twenty-one million, two hundred thirty-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •