Base | Representation |
---|---|
bin | 1101000111010110001… |
… | …10110110011010011001 |
3 | 1121002010112222122201120 |
4 | 12203223012312122121 |
5 | 24340332441242111 |
6 | 543002404435453 |
7 | 44361544433556 |
oct | 6435306663231 |
9 | 1532115878646 |
10 | 450621040281 |
11 | 16411a914185 |
12 | 734000a8b89 |
13 | 33654c62709 |
14 | 17b4b195a2d |
15 | bac5a65406 |
hex | 68eb1b6699 |
450621040281 has 4 divisors (see below), whose sum is σ = 600828053712. Its totient is φ = 300414026852.
The previous prime is 450621040271. The next prime is 450621040291. The reversal of 450621040281 is 182040126054.
It is a happy number.
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 (450621040271) and next prime (450621040291).
It is a cyclic number.
It is not a de Polignac number, because 450621040281 - 25 = 450621040249 is a prime.
It is a super-2 number, since 2×4506210402812 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (450621040271) 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, 75103506711 + ... + 75103506716.
It is an arithmetic number, because the mean of its divisors is an integer number (150207013428).
Almost surely, 2450621040281 is an apocalyptic number.
It is an amenable number.
450621040281 is a deficient number, since it is larger than the sum of its proper divisors (150207013431).
450621040281 is a wasteful number, since it uses less digits than its factorization.
450621040281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150207013430.
The product of its (nonzero) digits is 15360, while the sum is 33.
The spelling of 450621040281 in words is "four hundred fifty billion, six hundred twenty-one million, forty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •