Base | Representation |
---|---|
bin | 11101100101101011000100… |
… | …010001010011000100011111 |
3 | 122001202111222121012221012111 |
4 | 131211223010101103010133 |
5 | 114024041232233044403 |
6 | 1140433525104014451 |
7 | 36260512345166452 |
oct | 3545530421230437 |
9 | 561674877187174 |
10 | 130132212003103 |
11 | 38511841154aa2 |
12 | 127185b2601427 |
13 | 577c55180189b |
14 | 241c60b34b499 |
15 | 100a0866ea56d |
hex | 765ac445311f |
130132212003103 has 32 divisors (see below), whose sum is σ = 141111148953600. Its totient is φ = 119623196104416.
The previous prime is 130132212003083. The next prime is 130132212003107. The reversal of 130132212003103 is 301300212231031.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130132212003103 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 (130132212003107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 100494400 + ... + 101781082.
It is an arithmetic number, because the mean of its divisors is an integer number (4409723404800).
Almost surely, 2130132212003103 is an apocalyptic number.
130132212003103 is a deficient number, since it is larger than the sum of its proper divisors (10978936950497).
130132212003103 is a wasteful number, since it uses less digits than its factorization.
130132212003103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1287931.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 130132212003103 its reverse (301300212231031), we get a palindrome (431432424234134).
The spelling of 130132212003103 in words is "one hundred thirty trillion, one hundred thirty-two billion, two hundred twelve million, three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •