Base | Representation |
---|---|
bin | 11010110110010… |
… | …110011110000111 |
3 | 1011101121111200111 |
4 | 122312112132013 |
5 | 1410304033211 |
6 | 112410453451 |
7 | 14106544066 |
oct | 3266263607 |
9 | 1141544614 |
10 | 450455431 |
11 | 2112a7918 |
12 | 106a34287 |
13 | 7242909a |
14 | 43b7a1dd |
15 | 2982d421 |
hex | 1ad96787 |
450455431 has 4 divisors (see below), whose sum is σ = 451792432. Its totient is φ = 449118432.
The previous prime is 450455429. The next prime is 450455503. The reversal of 450455431 is 134554054.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 450455431 - 21 = 450455429 is a prime.
It is a super-2 number, since 2×4504554312 = 405820190634791522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 450455393 and 450455402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450456431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 667995 + ... + 668668.
It is an arithmetic number, because the mean of its divisors is an integer number (112948108).
Almost surely, 2450455431 is an apocalyptic number.
450455431 is a deficient number, since it is larger than the sum of its proper divisors (1337001).
450455431 is a wasteful number, since it uses less digits than its factorization.
450455431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1337000.
The product of its (nonzero) digits is 24000, while the sum is 31.
The square root of 450455431 is about 21223.9353325438. The cubic root of 450455431 is about 766.5678645414.
The spelling of 450455431 in words is "four hundred fifty million, four hundred fifty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •