Base | Representation |
---|---|
bin | 111100100100011010… |
… | …1101000011010110101 |
3 | 110102201212121022220211 |
4 | 1321020311220122311 |
5 | 4112341141200441 |
6 | 135430453425421 |
7 | 12253165402060 |
oct | 1711065503265 |
9 | 412655538824 |
10 | 130071037621 |
11 | 50187789808 |
12 | 2126063b271 |
13 | c35b817725 |
14 | 641cabb8d7 |
15 | 35b41e6a81 |
hex | 1e48d686b5 |
130071037621 has 4 divisors (see below), whose sum is σ = 148652614432. Its totient is φ = 111489460812.
The previous prime is 130071037589. The next prime is 130071037631. The reversal of 130071037621 is 126730170031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130071037621 - 25 = 130071037589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130071037631) 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 3 ways as a sum of consecutive naturals, for example, 9290788395 + ... + 9290788408.
It is an arithmetic number, because the mean of its divisors is an integer number (37163153608).
Almost surely, 2130071037621 is an apocalyptic number.
It is an amenable number.
130071037621 is a deficient number, since it is larger than the sum of its proper divisors (18581576811).
130071037621 is an equidigital number, since it uses as much as digits as its factorization.
130071037621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18581576810.
The product of its (nonzero) digits is 5292, while the sum is 31.
It can be divided in two parts, 1300710 and 37621, that added together give a palindrome (1338331).
The spelling of 130071037621 in words is "one hundred thirty billion, seventy-one million, thirty-seven thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •