Base | Representation |
---|---|
bin | 11000111000000… |
… | …111110000000001 |
3 | 1002002100100010201 |
4 | 120320013300001 |
5 | 1323321134433 |
6 | 105225325201 |
7 | 13225354363 |
oct | 3070076001 |
9 | 1062310121 |
10 | 417364993 |
11 | 1a4656551 |
12 | b7936801 |
13 | 68611546 |
14 | 3d604d33 |
15 | 26993a7d |
hex | 18e07c01 |
417364993 has 4 divisors (see below), whose sum is σ = 418484308. Its totient is φ = 416245680.
The previous prime is 417364973. The next prime is 417365021. The reversal of 417364993 is 399463714.
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 116273089 + 301091904 = 10783^2 + 17352^2 .
It is a cyclic number.
It is not a de Polignac number, because 417364993 - 213 = 417356801 is a prime.
It is a super-3 number, since 3×4173649933 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (417364933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 559098 + ... + 559843.
It is an arithmetic number, because the mean of its divisors is an integer number (104621077).
Almost surely, 2417364993 is an apocalyptic number.
It is an amenable number.
417364993 is a deficient number, since it is larger than the sum of its proper divisors (1119315).
417364993 is a wasteful number, since it uses less digits than its factorization.
417364993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1119314.
The product of its digits is 489888, while the sum is 46.
The square root of 417364993 is about 20429.5127939949. The cubic root of 417364993 is about 747.3178225929.
The spelling of 417364993 in words is "four hundred seventeen million, three hundred sixty-four thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •