Base | Representation |
---|---|
bin | 1011101101111111101… |
… | …0011100000011011010 |
3 | 201020122200202110200000 |
4 | 2323133322130003122 |
5 | 11244303213242132 |
6 | 232253144153430 |
7 | 20355011255364 |
oct | 2733772340332 |
9 | 636580673600 |
10 | 201325134042 |
11 | 78421875aaa |
12 | 33027468876 |
13 | 15ca5a17366 |
14 | 9a5c0a5d34 |
15 | 538497b87c |
hex | 2edfe9c0da |
201325134042 has 48 divisors (see below), whose sum is σ = 452676107520. Its totient is φ = 67061509632.
The previous prime is 201325133981. The next prime is 201325134061. The reversal of 201325134042 is 240431523102.
201325134042 is a `hidden beast` number, since 2 + 0 + 1 + 3 + 251 + 3 + 404 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 201325133997 and 201325134015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 555418 + ... + 843290.
It is an arithmetic number, because the mean of its divisors is an integer number (9430752240).
Almost surely, 2201325134042 is an apocalyptic number.
201325134042 is an abundant number, since it is smaller than the sum of its proper divisors (251350973478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201325134042 is a wasteful number, since it uses less digits than its factorization.
201325134042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289329 (or 289317 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 201325134042 its reverse (240431523102), we get a palindrome (441756657144).
The spelling of 201325134042 in words is "two hundred one billion, three hundred twenty-five million, one hundred thirty-four thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •