Base | Representation |
---|---|
bin | 11101100101011000100001… |
… | …100110100110101100001111 |
3 | 122001200121121002222110122020 |
4 | 131211120201212212230033 |
5 | 114023224444034024403 |
6 | 1140420433345421223 |
7 | 36256206106555236 |
oct | 3545304146465417 |
9 | 561617532873566 |
10 | 130112303033103 |
11 | 38504355050186 |
12 | 1271477703a813 |
13 | 577a6cac49971 |
14 | 241b67d19db1d |
15 | 10097bd961453 |
hex | 7656219a6b0f |
130112303033103 has 8 divisors (see below), whose sum is σ = 173520052838016. Its totient is φ = 86723044291800.
The previous prime is 130112303033087. The next prime is 130112303033159. The reversal of 130112303033103 is 301330303211031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130112303033103 - 24 = 130112303033087 is a prime.
It is a super-2 number, since 2×1301123030331032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130112303033183) 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, 4622749483 + ... + 4622777628.
It is an arithmetic number, because the mean of its divisors is an integer number (21690006604752).
Almost surely, 2130112303033103 is an apocalyptic number.
130112303033103 is a deficient number, since it is larger than the sum of its proper divisors (43407749804913).
130112303033103 is an equidigital number, since it uses as much as digits as its factorization.
130112303033103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9245531805.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 130112303033103 its reverse (301330303211031), we get a palindrome (431442606244134).
The spelling of 130112303033103 in words is "one hundred thirty trillion, one hundred twelve billion, three hundred three million, thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •