Base | Representation |
---|---|
bin | 1011101100110010001… |
… | …0101001011100010000 |
3 | 201012211001012120101010 |
4 | 2323030202221130100 |
5 | 11243122013132240 |
6 | 232201014210520 |
7 | 20343653626563 |
oct | 2731442513420 |
9 | 635731176333 |
10 | 201000130320 |
11 | 78275373990 |
12 | 32b56653a40 |
13 | 15c535a3772 |
14 | 9a2ac644da |
15 | 536617e280 |
hex | 2ecc8a9710 |
201000130320 has 80 divisors (see below), whose sum is σ = 679745904192. Its totient is φ = 48727303680.
The previous prime is 201000130291. The next prime is 201000130367. The reversal of 201000130320 is 23031000102.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 201000130296 and 201000130305.
It is an unprimeable number.
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, 38065567 + ... + 38070846.
Almost surely, 2201000130320 is an apocalyptic number.
201000130320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201000130320 is an abundant number, since it is smaller than the sum of its proper divisors (478745773872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201000130320 is a wasteful number, since it uses less digits than its factorization.
201000130320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76136440 (or 76136434 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 201000130320 its reverse (23031000102), we get a palindrome (224031130422).
The spelling of 201000130320 in words is "two hundred one billion, one hundred thirty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •