Base | Representation |
---|---|
bin | 1100000001010001111… |
… | …10011010111011111001 |
3 | 1110111000222110212211121 |
4 | 12000220332122323321 |
5 | 23231313100443223 |
6 | 513422003425241 |
7 | 41560426505665 |
oct | 6005076327371 |
9 | 1414028425747 |
10 | 413004312313 |
11 | 14a17719274a |
12 | 68062385221 |
13 | 2cc3b88cab8 |
14 | 15dbd3318a5 |
15 | ab233ed15d |
hex | 6028f9aef9 |
413004312313 has 4 divisors (see below), whose sum is σ = 430961021568. Its totient is φ = 395047603060.
The previous prime is 413004312223. The next prime is 413004312403. The reversal of 413004312313 is 313213400314.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (413004312223) and next prime (413004312403).
It is a cyclic number.
It is not a de Polignac number, because 413004312313 - 213 = 413004304121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (413004312013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8978354593 + ... + 8978354638.
It is an arithmetic number, because the mean of its divisors is an integer number (107740255392).
Almost surely, 2413004312313 is an apocalyptic number.
It is an amenable number.
413004312313 is a deficient number, since it is larger than the sum of its proper divisors (17956709255).
413004312313 is a wasteful number, since it uses less digits than its factorization.
413004312313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17956709254.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 413004312313 its reverse (313213400314), we get a palindrome (726217712627).
The spelling of 413004312313 in words is "four hundred thirteen billion, four million, three hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •