Base | Representation |
---|---|
bin | 1111100000000… |
… | …00110011100001 |
3 | 100001200001010111 |
4 | 13300000303201 |
5 | 231241323341 |
6 | 20522531321 |
7 | 3136131436 |
oct | 760006341 |
9 | 301601114 |
10 | 130026721 |
11 | 67440000 |
12 | 37666b41 |
13 | 20c279b6 |
14 | 133a9b8d |
15 | b636681 |
hex | 7c00ce1 |
130026721 has 20 divisors (see below), whose sum is σ = 146104560. Its totient is φ = 115690520.
The previous prime is 130026683. The next prime is 130026733. The reversal of 130026721 is 127620031.
It is not a de Polignac number, because 130026721 - 213 = 130018529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130026692 and 130026701.
It is not an unprimeable number, because it can be changed into a prime (130026781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1215150 + ... + 1215256.
It is an arithmetic number, because the mean of its divisors is an integer number (7305228).
Almost surely, 2130026721 is an apocalyptic number.
130026721 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130026721 is a deficient number, since it is larger than the sum of its proper divisors (16077839).
130026721 is an frugal number, since it uses more digits than its factorization.
130026721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234 (or 201 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 130026721 is about 11402.9259841499. The cubic root of 130026721 is about 506.6144080354.
Adding to 130026721 its reverse (127620031), we get a palindrome (257646752).
The spelling of 130026721 in words is "one hundred thirty million, twenty-six thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •