Base | Representation |
---|---|
bin | 11000010001010… |
… | …111100001111101 |
3 | 1001101020012122012 |
4 | 120101113201331 |
5 | 1313221043023 |
6 | 104223501005 |
7 | 13043123354 |
oct | 3021274175 |
9 | 1041205565 |
10 | 407206013 |
11 | 1999479a5 |
12 | b4457765 |
13 | 66495506 |
14 | 3c11c99b |
15 | 25b38978 |
hex | 1845787d |
407206013 has 4 divisors (see below), whose sum is σ = 408720060. Its totient is φ = 405691968.
The previous prime is 407206003. The next prime is 407206027. The reversal of 407206013 is 310602704.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 164531929 + 242674084 = 12827^2 + 15578^2 .
It is a cyclic number.
It is not a de Polignac number, because 407206013 - 26 = 407205949 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 407206013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (407206003) 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, 756620 + ... + 757157.
It is an arithmetic number, because the mean of its divisors is an integer number (102180015).
Almost surely, 2407206013 is an apocalyptic number.
It is an amenable number.
407206013 is a deficient number, since it is larger than the sum of its proper divisors (1514047).
407206013 is a wasteful number, since it uses less digits than its factorization.
407206013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1514046.
The product of its (nonzero) digits is 1008, while the sum is 23.
The square root of 407206013 is about 20179.3461985268. The cubic root of 407206013 is about 741.2045229539.
Adding to 407206013 its reverse (310602704), we get a palindrome (717808717).
The spelling of 407206013 in words is "four hundred seven million, two hundred six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •