Base | Representation |
---|---|
bin | 101011000011000… |
… | …1000111101001000 |
3 | 10201122222200001121 |
4 | 1112012020331020 |
5 | 10424234400440 |
6 | 355155325024 |
7 | 50536423561 |
oct | 12606107510 |
9 | 3648880047 |
10 | 1444450120 |
11 | 681399833 |
12 | 3438b0774 |
13 | 1a0342a19 |
14 | d9ba3168 |
15 | 86c2534a |
hex | 56188f48 |
1444450120 has 32 divisors (see below), whose sum is σ = 3258153720. Its totient is φ = 576332800.
The previous prime is 1444450099. The next prime is 1444450151. The reversal of 1444450120 is 210544441.
It can be written as a sum of positive squares in 4 ways, for example, as 1425666564 + 18783556 = 37758^2 + 4334^2 .
It is a super-2 number, since 2×14444501202 = 4172872298336028800, which contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 28987 + ... + 61066.
Almost surely, 21444450120 is an apocalyptic number.
1444450120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1444450120 is an abundant number, since it is smaller than the sum of its proper divisors (1813703600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1444450120 is a wasteful number, since it uses less digits than its factorization.
1444450120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90465 (or 90461 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 25.
The square root of 1444450120 is about 38005.9221701040. The cubic root of 1444450120 is about 1130.4052948753.
Adding to 1444450120 its reverse (210544441), we get a palindrome (1654994561).
The spelling of 1444450120 in words is "one billion, four hundred forty-four million, four hundred fifty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •