Base | Representation |
---|---|
bin | 11101000110110001000… |
… | …010011100100011100011 |
3 | 21002012200111110120222111 |
4 | 131012301002130203203 |
5 | 230232231240013443 |
6 | 4130502543220151 |
7 | 264335041332052 |
oct | 35066102344343 |
9 | 7065614416874 |
10 | 2000130001123 |
11 | 701283273631 |
12 | 28377b5a7657 |
13 | 1167c4480507 |
14 | 6cb41c50399 |
15 | 3706460b69d |
hex | 1d1b109c8e3 |
2000130001123 has 8 divisors (see below), whose sum is σ = 2002417837056. Its totient is φ = 1997842710600.
The previous prime is 2000130001081. The next prime is 2000130001169. The reversal of 2000130001123 is 3211000310002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000130001123 is a prime.
It is a super-2 number, since 2×20001300011232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2000130007123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7442178 + ... + 7706248.
It is an arithmetic number, because the mean of its divisors is an integer number (250302229632).
Almost surely, 22000130001123 is an apocalyptic number.
2000130001123 is a deficient number, since it is larger than the sum of its proper divisors (2287835933).
2000130001123 is an equidigital number, since it uses as much as digits as its factorization.
2000130001123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272705.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 2000130001123 its reverse (3211000310002), we get a palindrome (5211130311125).
The spelling of 2000130001123 in words is "two trillion, one hundred thirty million, one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •