Base | Representation |
---|---|
bin | 11101101000010001101010… |
… | …111100011110101101111111 |
3 | 122002101121201202022100110002 |
4 | 131220101222330132231333 |
5 | 114040004114102444444 |
6 | 1141052032133304515 |
7 | 36306444405112064 |
oct | 3550215274365577 |
9 | 562347652270402 |
10 | 130311101999999 |
11 | 3858069a96a438 |
12 | 127471b849513b |
13 | 57933904a235b |
14 | 242713b962c6b |
15 | 100ea56743d4e |
hex | 76846af1eb7f |
130311101999999 has 4 divisors (see below), whose sum is σ = 131031052839960. Its totient is φ = 129591151160040.
The previous prime is 130311101999927. The next prime is 130311102000007. The reversal of 130311101999999 is 999999101113031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130311101999999 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 (130311101999599) 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 3 ways as a sum of consecutive naturals, for example, 359975419709 + ... + 359975420070.
It is an arithmetic number, because the mean of its divisors is an integer number (32757763209990).
Almost surely, 2130311101999999 is an apocalyptic number.
130311101999999 is a deficient number, since it is larger than the sum of its proper divisors (719950839961).
130311101999999 is an equidigital number, since it uses as much as digits as its factorization.
130311101999999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 719950839960.
The product of its (nonzero) digits is 4782969, while the sum is 65.
The spelling of 130311101999999 in words is "one hundred thirty trillion, three hundred eleven billion, one hundred one million, nine hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •