Base | Representation |
---|---|
bin | 1111100000110… |
… | …10000001011011 |
3 | 100001212021211001 |
4 | 13300122001123 |
5 | 231303130021 |
6 | 20525045431 |
7 | 3140041534 |
oct | 760320133 |
9 | 301767731 |
10 | 130130011 |
11 | 67500670 |
12 | 376b6877 |
13 | 20c62a0b |
14 | 133d568b |
15 | b657091 |
hex | 7c1a05b |
130130011 has 8 divisors (see below), whose sum is σ = 142127424. Its totient is φ = 118160520.
The previous prime is 130129991. The next prime is 130130027. The reversal of 130130011 is 110031031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130130011 - 213 = 130121819 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 130130011.
It is not an unprimeable number, because it can be changed into a prime (130131011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3456 + ... + 16498.
It is an arithmetic number, because the mean of its divisors is an integer number (17765928).
Almost surely, 2130130011 is an apocalyptic number.
130130011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130130011 is a deficient number, since it is larger than the sum of its proper divisors (11997413).
130130011 is a wasteful number, since it uses less digits than its factorization.
130130011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13961.
The product of its (nonzero) digits is 9, while the sum is 10.
The square root of 130130011 is about 11407.4541857506. The cubic root of 130130011 is about 506.7485198340.
Adding to 130130011 its reverse (110031031), we get a palindrome (240161042).
The spelling of 130130011 in words is "one hundred thirty million, one hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •