Base | Representation |
---|---|
bin | 11010110110001… |
… | …111010111011011 |
3 | 1011101120000202201 |
4 | 122312033113123 |
5 | 1410302120311 |
6 | 112410111031 |
7 | 14106363205 |
oct | 3266172733 |
9 | 1141500681 |
10 | 450426331 |
11 | 211287a73 |
12 | 106a1b477 |
13 | 72418a74 |
14 | 43b6d775 |
15 | 298249c1 |
hex | 1ad8f5db |
450426331 has 8 divisors (see below), whose sum is σ = 476121600. Its totient is φ = 424929960.
The previous prime is 450426329. The next prime is 450426359. The reversal of 450426331 is 133624054.
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 450426331 - 21 = 450426329 is a prime.
It is a super-2 number, since 2×4504263312 = 405767759316243122, which contains 22 as substring.
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 450426331.
It is not an unprimeable number, because it can be changed into a prime (450426391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45055 + ... + 54136.
It is an arithmetic number, because the mean of its divisors is an integer number (59515200).
Almost surely, 2450426331 is an apocalyptic number.
450426331 is a deficient number, since it is larger than the sum of its proper divisors (25695269).
450426331 is a wasteful number, since it uses less digits than its factorization.
450426331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99449.
The product of its (nonzero) digits is 8640, while the sum is 28.
The square root of 450426331 is about 21223.2497747164. The cubic root of 450426331 is about 766.5513570960.
The spelling of 450426331 in words is "four hundred fifty million, four hundred twenty-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •