Base | Representation |
---|---|
bin | 11101100101001110010001… |
… | …111110011010110100000011 |
3 | 122001122120012112021100011020 |
4 | 131211032101332122310003 |
5 | 114023034432134002321 |
6 | 1140411414053520523 |
7 | 36255336403452642 |
oct | 3545162176326403 |
9 | 561576175240136 |
10 | 130101303422211 |
11 | 384aa720058770 |
12 | 12712607343143 |
13 | 577966712a474 |
14 | 241ad18391359 |
15 | 1009377e4c4c6 |
hex | 765391f9ad03 |
130101303422211 has 8 divisors (see below), whose sum is σ = 189238259523264. Its totient is φ = 78849274801320.
The previous prime is 130101303422179. The next prime is 130101303422231. The reversal of 130101303422211 is 112224303101031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130101303422211 - 25 = 130101303422179 is a prime.
It is not an unprimeable number, because it can be changed into a prime (130101303422231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1971231870001 + ... + 1971231870066.
It is an arithmetic number, because the mean of its divisors is an integer number (23654782440408).
Almost surely, 2130101303422211 is an apocalyptic number.
130101303422211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130101303422211 is a deficient number, since it is larger than the sum of its proper divisors (59136956101053).
130101303422211 is a wasteful number, since it uses less digits than its factorization.
130101303422211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3942463740081.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 130101303422211 its reverse (112224303101031), we get a palindrome (242325606523242).
The spelling of 130101303422211 in words is "one hundred thirty trillion, one hundred one billion, three hundred three million, four hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •