Base | Representation |
---|---|
bin | 111011100110111… |
… | …0010101001001111 |
3 | 12011101112210220111 |
4 | 1313031302221033 |
5 | 13044011312030 |
6 | 530245100451 |
7 | 100364414020 |
oct | 16715625117 |
9 | 5141483814 |
10 | 2000104015 |
11 | 937008828 |
12 | 4799b7727 |
13 | 25b4b2800 |
14 | 14d8c4c47 |
15 | ba8d362a |
hex | 77372a4f |
2000104015 has 24 divisors (see below), whose sum is σ = 2970239328. Its totient is φ = 1265996160.
The previous prime is 2000103997. The next prime is 2000104019. The reversal of 2000104015 is 5104010002.
It is not a de Polignac number, because 2000104015 - 27 = 2000103887 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 2000103986 and 2000104004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000104019) 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 23 ways as a sum of consecutive naturals, for example, 163156 + ... + 174985.
It is an arithmetic number, because the mean of its divisors is an integer number (123759972).
Almost surely, 22000104015 is an apocalyptic number.
2000104015 is a deficient number, since it is larger than the sum of its proper divisors (970135313).
2000104015 is a wasteful number, since it uses less digits than its factorization.
2000104015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338179 (or 338166 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 2000104015 is about 44722.5224579294. The cubic root of 2000104015 is about 1259.9428912976.
Adding to 2000104015 its reverse (5104010002), we get a palindrome (7104114017).
The spelling of 2000104015 in words is "two billion, one hundred four thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •