Base | Representation |
---|---|
bin | 1011101101010001001… |
… | …1010010000001101111 |
3 | 201020011010011220000111 |
4 | 2323110103102001233 |
5 | 11243403330214413 |
6 | 232221544440451 |
7 | 20350124340355 |
oct | 2732423220157 |
9 | 636133156014 |
10 | 201130319983 |
11 | 7833190534a |
12 | 32b92179127 |
13 | 15c74557678 |
14 | 9a402737d5 |
15 | 53727e8d3d |
hex | 2ed44d206f |
201130319983 has 16 divisors (see below), whose sum is σ = 210444065280. Its totient is φ = 191864399584.
The previous prime is 201130319953. The next prime is 201130320011. The reversal of 201130319983 is 389913031102.
201130319983 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201130319983 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201130319933) 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, 40885998 + ... + 40890916.
It is an arithmetic number, because the mean of its divisors is an integer number (13152754080).
Almost surely, 2201130319983 is an apocalyptic number.
201130319983 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
201130319983 is a deficient number, since it is larger than the sum of its proper divisors (9313745297).
201130319983 is a wasteful number, since it uses less digits than its factorization.
201130319983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9398.
The product of its (nonzero) digits is 34992, while the sum is 40.
The spelling of 201130319983 in words is "two hundred one billion, one hundred thirty million, three hundred nineteen thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •