Base | Representation |
---|---|
bin | 110000011011100000… |
… | …0100101011011110001 |
3 | 100221110002022212100210 |
4 | 1200313000211123301 |
5 | 3200444020142223 |
6 | 115440010134333 |
7 | 10341161252115 |
oct | 1406700453361 |
9 | 327402285323 |
10 | 104002115313 |
11 | 4011a534618 |
12 | 181a61213a9 |
13 | 9a659c1c05 |
14 | 50687a5745 |
15 | 2a8a77b893 |
hex | 18370256f1 |
104002115313 has 8 divisors (see below), whose sum is σ = 146826515808. Its totient is φ = 65256229184.
The previous prime is 104002115309. The next prime is 104002115333. The reversal of 104002115313 is 313511200401.
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 104002115313 - 22 = 104002115309 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104002115313.
It is not an unprimeable number, because it can be changed into a prime (104002115333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1019628531 + ... + 1019628632.
It is an arithmetic number, because the mean of its divisors is an integer number (18353314476).
Almost surely, 2104002115313 is an apocalyptic number.
It is an amenable number.
104002115313 is a deficient number, since it is larger than the sum of its proper divisors (42824400495).
104002115313 is a wasteful number, since it uses less digits than its factorization.
104002115313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2039257183.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 104002115313 its reverse (313511200401), we get a palindrome (417513315714).
The spelling of 104002115313 in words is "one hundred four billion, two million, one hundred fifteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •