Base | Representation |
---|---|
bin | 111011100110111… |
… | …0111110110000001 |
3 | 12011101120220010022 |
4 | 1313031313312001 |
5 | 13044013002223 |
6 | 530245343225 |
7 | 100364533064 |
oct | 16715676601 |
9 | 5141526108 |
10 | 2000125313 |
11 | 93702282a |
12 | 479a07b15 |
13 | 25b4bc404 |
14 | 14d8cc8db |
15 | ba8d9ac8 |
hex | 77377d81 |
2000125313 has 8 divisors (see below), whose sum is σ = 2020681920. Its totient is φ = 1979665200.
The previous prime is 2000125277. The next prime is 2000125367. The reversal of 2000125313 is 3135210002.
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 2000125313 - 212 = 2000121217 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2000125291 and 2000125300.
It is not an unprimeable number, because it can be changed into a prime (2000125913) 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, 17918 + ... + 65736.
It is an arithmetic number, because the mean of its divisors is an integer number (252585240).
Almost surely, 22000125313 is an apocalyptic number.
It is an amenable number.
2000125313 is a deficient number, since it is larger than the sum of its proper divisors (20556607).
2000125313 is a wasteful number, since it uses less digits than its factorization.
2000125313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48247.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 2000125313 is about 44722.7605699827. The cubic root of 2000125313 is about 1259.9473634264.
Adding to 2000125313 its reverse (3135210002), we get a palindrome (5135335315).
The spelling of 2000125313 in words is "two billion, one hundred twenty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •