Base | Representation |
---|---|
bin | 11101101000100101001001… |
… | …001110110010100101011111 |
3 | 122002110121200221200022212011 |
4 | 131220211021032302211133 |
5 | 114040324424332223403 |
6 | 1141105411022252051 |
7 | 36311114510350162 |
oct | 3550451116624537 |
9 | 562417627608764 |
10 | 130332011211103 |
11 | 3858954a642199 |
12 | 1274b272a27027 |
13 | 579534334a110 |
14 | 24281628c1ad9 |
15 | 101037c20aa6d |
hex | 7689493b295f |
130332011211103 has 16 divisors (see below), whose sum is σ = 142661297217600. Its totient is φ = 118331909383680.
The previous prime is 130332011210987. The next prime is 130332011211137. The reversal of 130332011211103 is 301112110233031.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130332011211103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130332011211503) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39424263 + ... + 42602071.
It is an arithmetic number, because the mean of its divisors is an integer number (8916331076100).
Almost surely, 2130332011211103 is an apocalyptic number.
130332011211103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
130332011211103 is a deficient number, since it is larger than the sum of its proper divisors (12329286006497).
130332011211103 is a wasteful number, since it uses less digits than its factorization.
130332011211103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3229602.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 130332011211103 its reverse (301112110233031), we get a palindrome (431444121444134).
The spelling of 130332011211103 in words is "one hundred thirty trillion, three hundred thirty-two billion, eleven million, two hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •