Base | Representation |
---|---|
bin | 11101100011111011000111… |
… | …001101110011000110101111 |
3 | 122001100000200222111222112111 |
4 | 131203323013031303012233 |
5 | 114020104040044124403 |
6 | 1140302404521344451 |
7 | 36246025421643322 |
oct | 3543730715630657 |
9 | 561300628458474 |
10 | 130012002333103 |
11 | 38475864a02790 |
12 | 126b9244638127 |
13 | 5771105055937 |
14 | 24168862267b9 |
15 | 1006d9d12a56d |
hex | 763ec73731af |
130012002333103 has 8 divisors (see below), whose sum is σ = 141831682286976. Its totient is φ = 118192390215000.
The previous prime is 130012002333089. The next prime is 130012002333113. The reversal of 130012002333103 is 301333200210031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130012002333103 - 29 = 130012002332591 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130012002333113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12909523 + ... + 20656228.
It is an arithmetic number, because the mean of its divisors is an integer number (17728960285872).
Almost surely, 2130012002333103 is an apocalyptic number.
130012002333103 is a deficient number, since it is larger than the sum of its proper divisors (11819679953873).
130012002333103 is a wasteful number, since it uses less digits than its factorization.
130012002333103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33917885.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 130012002333103 its reverse (301333200210031), we get a palindrome (431345202543134).
The spelling of 130012002333103 in words is "one hundred thirty trillion, twelve billion, two million, three hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •