Base | Representation |
---|---|
bin | 111100100101100101… |
… | …1000100010011100111 |
3 | 110102211121022120002221 |
4 | 1321023023010103213 |
5 | 4112431203230203 |
6 | 135434413213211 |
7 | 12254152356052 |
oct | 1711313042347 |
9 | 412747276087 |
10 | 130110211303 |
11 | 501a7905556 |
12 | 21271791207 |
13 | c366982117 |
14 | 6423d97a99 |
15 | 35b7883abd |
hex | 1e4b2c44e7 |
130110211303 has 8 divisors (see below), whose sum is σ = 130651942320. Its totient is φ = 129569039040.
The previous prime is 130110211279. The next prime is 130110211313. The reversal of 130110211303 is 303112011031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130110211303 is a prime.
It is a super-2 number, since 2×1301102113032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130110211313) 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 7 ways as a sum of consecutive naturals, for example, 330276 + ... + 607702.
It is an arithmetic number, because the mean of its divisors is an integer number (16331492790).
Almost surely, 2130110211303 is an apocalyptic number.
130110211303 is a deficient number, since it is larger than the sum of its proper divisors (541731017).
130110211303 is a wasteful number, since it uses less digits than its factorization.
130110211303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279377.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 130110211303 its reverse (303112011031), we get a palindrome (433222222334).
The spelling of 130110211303 in words is "one hundred thirty billion, one hundred ten million, two hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •