Base | Representation |
---|---|
bin | 101011010000101… |
… | …1011101000100000 |
3 | 10202011110011001002 |
4 | 1112201123220200 |
5 | 10433102321022 |
6 | 400012531132 |
7 | 50654302061 |
oct | 12641335040 |
9 | 3664404032 |
10 | 1451604512 |
11 | 685435a56 |
12 | 346180aa8 |
13 | 1a19792a7 |
14 | dab06568 |
15 | 8768a092 |
hex | 5685ba20 |
1451604512 has 48 divisors (see below), whose sum is σ = 3051820800. Its totient is φ = 678155520.
The previous prime is 1451604509. The next prime is 1451604521. The reversal of 1451604512 is 2154061541.
It is a Harshad number since it is a multiple of its sum of digits (29).
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, 3539 + ... + 53997.
It is an arithmetic number, because the mean of its divisors is an integer number (63579600).
Almost surely, 21451604512 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 1451604512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1525910400).
1451604512 is an abundant number, since it is smaller than the sum of its proper divisors (1600216288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1451604512 is a wasteful number, since it uses less digits than its factorization.
1451604512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50529 (or 50521 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 29.
The square root of 1451604512 is about 38099.9279789346. The cubic root of 1451604512 is about 1132.2685291525.
The spelling of 1451604512 in words is "one billion, four hundred fifty-one million, six hundred four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •