Base | Representation |
---|---|
bin | 101011000011000… |
… | …1010100111000100 |
3 | 10201200000000100201 |
4 | 1112012022213010 |
5 | 10424240110100 |
6 | 355155420244 |
7 | 50536452415 |
oct | 12606124704 |
9 | 3650000321 |
10 | 1444456900 |
11 | 6813a3937 |
12 | 3438b4684 |
13 | 1a0345b33 |
14 | d9ba580c |
15 | 86c2736a |
hex | 5618a9c4 |
1444456900 has 36 divisors (see below), whose sum is σ = 3143580048. Its totient is φ = 576103840.
The previous prime is 1444456889. The next prime is 1444456919. The reversal of 1444456900 is 96544441.
It is a super-2 number, since 2×14444569002 = 4172911471915220000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1444456900.
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 11 ways as a sum of consecutive naturals, for example, 13887 + ... + 55513.
It is an arithmetic number, because the mean of its divisors is an integer number (87321668).
Almost surely, 21444456900 is an apocalyptic number.
1444456900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1444456900 is an abundant number, since it is smaller than the sum of its proper divisors (1699123148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1444456900 is a wasteful number, since it uses less digits than its factorization.
1444456900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41988 (or 41981 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 37.
The square root of 1444456900 is about 38006.0113666246. The cubic root of 1444456900 is about 1130.4070635151.
The spelling of 1444456900 in words is "one billion, four hundred forty-four million, four hundred fifty-six thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •