Base | Representation |
---|---|
bin | 1011101101111100110… |
… | …0001100111001000000 |
3 | 201020121211221200011002 |
4 | 2323133030030321000 |
5 | 11244242112411222 |
6 | 232252032311132 |
7 | 20354503244105 |
oct | 2733714147100 |
9 | 636554850132 |
10 | 201313013312 |
11 | 78415a47574 |
12 | 330233a24a8 |
13 | 15ca3362428 |
14 | 9a5a62caac |
15 | 5383885392 |
hex | 2edf30ce40 |
201313013312 has 56 divisors (see below), whose sum is σ = 410557065600. Its totient is φ = 97886025216.
The previous prime is 201313013207. The next prime is 201313013323. The reversal of 201313013312 is 213310313102.
201313013312 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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, 470489 + ... + 789927.
Almost surely, 2201313013312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201313013312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205278532800).
201313013312 is an abundant number, since it is smaller than the sum of its proper divisors (209244052288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201313013312 is a wasteful number, since it uses less digits than its factorization.
201313013312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319723 (or 319713 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 201313013312 its reverse (213310313102), we get a palindrome (414623326414).
The spelling of 201313013312 in words is "two hundred one billion, three hundred thirteen million, thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •