Base | Representation |
---|---|
bin | 111100110001001100… |
… | …1111111110101001101 |
3 | 110110211202202221012010 |
4 | 1321202121333311031 |
5 | 4114231000013401 |
6 | 135541215531433 |
7 | 12266624464341 |
oct | 1714231776515 |
9 | 413752687163 |
10 | 130500001101 |
11 | 50387937388 |
12 | 21360229b79 |
13 | c3c965a282 |
14 | 645da61621 |
15 | 35dbbcbed6 |
hex | 1e6267fd4d |
130500001101 has 8 divisors (see below), whose sum is σ = 184235295744. Its totient is φ = 81882353600.
The previous prime is 130500001097. The next prime is 130500001103. The reversal of 130500001101 is 101100005031.
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 130500001101 - 22 = 130500001097 is a prime.
It is a super-2 number, since 2×1305000011012 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130500001103) 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 7 ways as a sum of consecutive naturals, for example, 1279411725 + ... + 1279411826.
It is an arithmetic number, because the mean of its divisors is an integer number (23029411968).
Almost surely, 2130500001101 is an apocalyptic number.
It is an amenable number.
130500001101 is a deficient number, since it is larger than the sum of its proper divisors (53735294643).
130500001101 is a wasteful number, since it uses less digits than its factorization.
130500001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2558823571.
The product of its (nonzero) digits is 15, while the sum is 12.
Adding to 130500001101 its reverse (101100005031), we get a palindrome (231600006132).
The spelling of 130500001101 in words is "one hundred thirty billion, five hundred million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •