Base | Representation |
---|---|
bin | 11011110010100… |
… | …000110011101101 |
3 | 1012111021202101221 |
4 | 123302200303231 |
5 | 1423323221123 |
6 | 114132503341 |
7 | 14360600452 |
oct | 3362406355 |
9 | 1174252357 |
10 | 466226413 |
11 | 21a199894 |
12 | 11017ab51 |
13 | 7578b623 |
14 | 45cc3829 |
15 | 2ade625d |
hex | 1bca0ced |
466226413 has 4 divisors (see below), whose sum is σ = 466393248. Its totient is φ = 466059580.
The previous prime is 466226407. The next prime is 466226419. The reversal of 466226413 is 314622664.
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 (466226407) and next prime (466226419).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-466226413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (466226419) 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, 79153 + ... + 84838.
It is an arithmetic number, because the mean of its divisors is an integer number (116598312).
Almost surely, 2466226413 is an apocalyptic number.
It is an amenable number.
466226413 is a deficient number, since it is larger than the sum of its proper divisors (166835).
466226413 is a wasteful number, since it uses less digits than its factorization.
466226413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166834.
The product of its digits is 41472, while the sum is 34.
The square root of 466226413 is about 21592.2766979307. The cubic root of 466226413 is about 775.4115957265.
It can be divided in two parts, 46622 and 6413, that added together give a palindrome (53035).
The spelling of 466226413 in words is "four hundred sixty-six million, two hundred twenty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •