Base | Representation |
---|---|
bin | 101011001011011… |
… | …1101100110011000 |
3 | 10201222021201100120 |
4 | 1112112331212120 |
5 | 10431402010211 |
6 | 355434033240 |
7 | 50622051540 |
oct | 12626754630 |
9 | 3658251316 |
10 | 1448860056 |
11 | 683931006 |
12 | 345278820 |
13 | 1a1228057 |
14 | da5d0320 |
15 | 872e6d06 |
hex | 565bd998 |
1448860056 has 128 divisors (see below), whose sum is σ = 4203962880. Its totient is φ = 407586816.
The previous prime is 1448860043. The next prime is 1448860073. The reversal of 1448860056 is 6500688441.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 4299120 + ... + 4299456.
It is an arithmetic number, because the mean of its divisors is an integer number (32843460).
Almost surely, 21448860056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1448860056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2101981440).
1448860056 is an abundant number, since it is smaller than the sum of its proper divisors (2755102824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1448860056 is a wasteful number, since it uses less digits than its factorization.
1448860056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673 (or 669 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 42.
The square root of 1448860056 is about 38063.8943882520. The cubic root of 1448860056 is about 1131.5545096998.
The spelling of 1448860056 in words is "one billion, four hundred forty-eight million, eight hundred sixty thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •