Base | Representation |
---|---|
bin | 11101100101010001001100… |
… | …010110111110011111111011 |
3 | 122001122212021110021101110122 |
4 | 131211101030112332133323 |
5 | 114023112333142001021 |
6 | 1140413052240203455 |
7 | 36255510033512303 |
oct | 3545211426763773 |
9 | 561585243241418 |
10 | 130104430422011 |
11 | 38500a85180a21 |
12 | 1271313a60958b |
13 | 5779a44c199c6 |
14 | 241b1337b6603 |
15 | 10094ac72abab |
hex | 76544c5be7fb |
130104430422011 has 4 divisors (see below), whose sum is σ = 130106416905672. Its totient is φ = 130102443938352.
The previous prime is 130104430421963. The next prime is 130104430422037. The reversal of 130104430422011 is 110224034401031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130104430422011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130104430422511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 993143585 + ... + 993274578.
It is an arithmetic number, because the mean of its divisors is an integer number (32526604226418).
Almost surely, 2130104430422011 is an apocalyptic number.
130104430422011 is a deficient number, since it is larger than the sum of its proper divisors (1986483661).
130104430422011 is an equidigital number, since it uses as much as digits as its factorization.
130104430422011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1986483660.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 130104430422011 its reverse (110224034401031), we get a palindrome (240328464823042).
The spelling of 130104430422011 in words is "one hundred thirty trillion, one hundred four billion, four hundred thirty million, four hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •