Base | Representation |
---|---|
bin | 11000010000101… |
… | …010000111101101 |
3 | 1001100212202111022 |
4 | 120100222013231 |
5 | 1313144120023 |
6 | 104215503525 |
7 | 13041420161 |
oct | 3020520755 |
9 | 1040782438 |
10 | 407020013 |
11 | 199830184 |
12 | b4387ba5 |
13 | 6642b95a |
14 | 3c0b0ca1 |
15 | 25aed7c8 |
hex | 1842a1ed |
407020013 has 8 divisors (see below), whose sum is σ = 413138880. Its totient is φ = 400947040.
The previous prime is 407019989. The next prime is 407020021. The reversal of 407020013 is 310020704.
It is a happy number.
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 407020013 - 214 = 407003629 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 = 407019973 and 407020000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (407020063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6608 + ... + 29286.
It is an arithmetic number, because the mean of its divisors is an integer number (51642360).
Almost surely, 2407020013 is an apocalyptic number.
It is an amenable number.
407020013 is a deficient number, since it is larger than the sum of its proper divisors (6118867).
407020013 is a wasteful number, since it uses less digits than its factorization.
407020013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22947.
The product of its (nonzero) digits is 168, while the sum is 17.
The square root of 407020013 is about 20174.7369995249. The cubic root of 407020013 is about 741.0916521277.
Adding to 407020013 its reverse (310020704), we get a palindrome (717040717).
The spelling of 407020013 in words is "four hundred seven million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •