Base | Representation |
---|---|
bin | 1011101101010001001… |
… | …0111100110111010111 |
3 | 201020011010000111010010 |
4 | 2323110102330313113 |
5 | 11243403314431203 |
6 | 232221542531303 |
7 | 20350123526556 |
oct | 2732422746727 |
9 | 636133014103 |
10 | 201130233303 |
11 | 7833185620a |
12 | 32b92136b33 |
13 | 15c7452708c |
14 | 9a4024dd9d |
15 | 53727cd303 |
hex | 2ed44bcdd7 |
201130233303 has 4 divisors (see below), whose sum is σ = 268173644408. Its totient is φ = 134086822200.
The previous prime is 201130233263. The next prime is 201130233329. The reversal of 201130233303 is 303332031102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 201130233303 - 213 = 201130225111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201130233303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201130233103) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 33521705548 + ... + 33521705553.
It is an arithmetic number, because the mean of its divisors is an integer number (67043411102).
Almost surely, 2201130233303 is an apocalyptic number.
201130233303 is a deficient number, since it is larger than the sum of its proper divisors (67043411105).
201130233303 is an equidigital number, since it uses as much as digits as its factorization.
201130233303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67043411104.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 201130233303 its reverse (303332031102), we get a palindrome (504462264405).
The spelling of 201130233303 in words is "two hundred one billion, one hundred thirty million, two hundred thirty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •