Base | Representation |
---|---|
bin | 101011001110111… |
… | …0010011000000000 |
3 | 10202002122121110000 |
4 | 1112131302120000 |
5 | 10432331232323 |
6 | 355540240000 |
7 | 50643212430 |
oct | 12635623000 |
9 | 3662577400 |
10 | 1450649088 |
11 | 684943149 |
12 | 3459a0000 |
13 | 1a1703455 |
14 | da9382c0 |
15 | 8754be43 |
hex | 56772600 |
1450649088 has 400 divisors, whose sum is σ = 5228593920. Its totient is φ = 391163904.
The previous prime is 1450649041. The next prime is 1450649089. The reversal of 1450649088 is 8809460541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1450649089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5515645 + ... + 5515907.
Almost surely, 21450649088 is an apocalyptic number.
1450649088 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1450649088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2614296960).
1450649088 is an abundant number, since it is smaller than the sum of its proper divisors (3777944832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1450649088 is an equidigital number, since it uses as much as digits as its factorization.
1450649088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319 (or 294 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 45.
The square root of 1450649088 is about 38087.3875187049. The cubic root of 1450649088 is about 1132.0200606599.
The spelling of 1450649088 in words is "one billion, four hundred fifty million, six hundred forty-nine thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •