Base | Representation |
---|---|
bin | 11101100111000110011100… |
… | …000101010001101111011111 |
3 | 122002002220020001111201211111 |
4 | 131213012130011101233133 |
5 | 114032143144413323403 |
6 | 1140550552314002451 |
7 | 36300554532410266 |
oct | 3547063405215737 |
9 | 562086201451744 |
10 | 130230322011103 |
11 | 3854a407750136 |
12 | 12733613416427 |
13 | 57888888a2b62 |
14 | 242327738b5dd |
15 | 100c8c9a5256d |
hex | 76719c151bdf |
130230322011103 has 4 divisors (see below), whose sum is σ = 130231312163568. Its totient is φ = 130229331858640.
The previous prime is 130230322011043. The next prime is 130230322011137. The reversal of 130230322011103 is 301110223032031.
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-130230322011103 is a prime.
It is a super-2 number, since 2×1302303220111032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130230322012103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 494878918 + ... + 495142003.
It is an arithmetic number, because the mean of its divisors is an integer number (32557828040892).
Almost surely, 2130230322011103 is an apocalyptic number.
130230322011103 is a deficient number, since it is larger than the sum of its proper divisors (990152465).
130230322011103 is an equidigital number, since it uses as much as digits as its factorization.
130230322011103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 990152464.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 130230322011103 its reverse (301110223032031), we get a palindrome (431340545043134).
The spelling of 130230322011103 in words is "one hundred thirty trillion, two hundred thirty billion, three hundred twenty-two million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •