Base | Representation |
---|---|
bin | 1101000110111110100… |
… | …10100001001010000001 |
3 | 1121001121201220121020222 |
4 | 12203133102201022001 |
5 | 24334431212203403 |
6 | 542531003112425 |
7 | 44353616252141 |
oct | 6433722411201 |
9 | 1531551817228 |
10 | 450422772353 |
11 | 164028a04594 |
12 | 73365812715 |
13 | 33622b63908 |
14 | 17b2cb04921 |
15 | bab344e338 |
hex | 68df4a1281 |
450422772353 has 4 divisors (see below), whose sum is σ = 450507715008. Its totient is φ = 450337829700.
The previous prime is 450422772341. The next prime is 450422772361. The reversal of 450422772353 is 353277224054.
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 a cyclic number.
It is not a de Polignac number, because 450422772353 - 228 = 450154336897 is a prime.
It is a super-2 number, since 2×4504227723532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (450422774353) 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, 42463373 + ... + 42473978.
It is an arithmetic number, because the mean of its divisors is an integer number (112626928752).
Almost surely, 2450422772353 is an apocalyptic number.
It is an amenable number.
450422772353 is a deficient number, since it is larger than the sum of its proper divisors (84942655).
450422772353 is an equidigital number, since it uses as much as digits as its factorization.
450422772353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84942654.
The product of its (nonzero) digits is 1411200, while the sum is 44.
The spelling of 450422772353 in words is "four hundred fifty billion, four hundred twenty-two million, seven hundred seventy-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •