Base | Representation |
---|---|
bin | 1011101110000011100… |
… | …0000111100101101100 |
3 | 201020200211011221111210 |
4 | 2323200320013211230 |
5 | 11244321333200043 |
6 | 232254522514420 |
7 | 20355265560546 |
oct | 2734070074554 |
9 | 636624157453 |
10 | 201341303148 |
11 | 7842aa0a0a7 |
12 | 33030965a10 |
13 | 15ca9188b8b |
14 | 9a602b4696 |
15 | 53860c2633 |
hex | 2ee0e0796c |
201341303148 has 48 divisors (see below), whose sum is σ = 494575038720. Its totient is φ = 63574709184.
The previous prime is 201341303147. The next prime is 201341303179. The reversal of 201341303148 is 841303143102.
It is a happy number.
201341303148 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×2013413031483 (a number of 35 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (201341303147) 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 15 ways as a sum of consecutive naturals, for example, 2378161 + ... + 2461367.
It is an arithmetic number, because the mean of its divisors is an integer number (10303646640).
Almost surely, 2201341303148 is an apocalyptic number.
It is an amenable number.
201341303148 is an abundant number, since it is smaller than the sum of its proper divisors (293233735572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201341303148 is a wasteful number, since it uses less digits than its factorization.
201341303148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93846 (or 93844 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The spelling of 201341303148 in words is "two hundred one billion, three hundred forty-one million, three hundred three thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •