Base | Representation |
---|---|
bin | 1011101110000000111… |
… | …0001100001111101100 |
3 | 201020200001111112201121 |
4 | 2323200032030033230 |
5 | 11244311024442142 |
6 | 232253451150324 |
7 | 20355103263103 |
oct | 2734016141754 |
9 | 636601445647 |
10 | 201330312172 |
11 | 78424792450 |
12 | 330291453a4 |
13 | 15ca6b0b242 |
14 | 9a5ca5303a |
15 | 5385150c67 |
hex | 2ee038c3ec |
201330312172 has 36 divisors (see below), whose sum is σ = 387315748008. Its totient is φ = 90814859200.
The previous prime is 201330312167. The next prime is 201330312173. The reversal of 201330312172 is 271213033102.
It is a happy number.
201330312172 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (201330312173) 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 11 ways as a sum of consecutive naturals, for example, 621768 + ... + 888400.
It is an arithmetic number, because the mean of its divisors is an integer number (10758770778).
Almost surely, 2201330312172 is an apocalyptic number.
201330312172 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
201330312172 is a deficient number, since it is larger than the sum of its proper divisors (185985435836).
201330312172 is a wasteful number, since it uses less digits than its factorization.
201330312172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266910 (or 266777 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 25.
Adding to 201330312172 its reverse (271213033102), we get a palindrome (472543345274).
The spelling of 201330312172 in words is "two hundred one billion, three hundred thirty million, three hundred twelve thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •