Base | Representation |
---|---|
bin | 101011100010110… |
… | …0010100111000000 |
3 | 10202211021001121210 |
4 | 1113011202213000 |
5 | 10443013222042 |
6 | 400551450120 |
7 | 51130615044 |
oct | 12705424700 |
9 | 3684231553 |
10 | 1461070272 |
11 | 68a8107a2 |
12 | 349386940 |
13 | 1a391192c |
14 | dc08c024 |
15 | 88409a9c |
hex | 571629c0 |
1461070272 has 56 divisors (see below), whose sum is σ = 3880256400. Its totient is φ = 485195776.
The previous prime is 1461070271. The next prime is 1461070327. The reversal of 1461070272 is 2720701641.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1461070271) 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 7 ways as a sum of consecutive naturals, for example, 37504 + ... + 65792.
Almost surely, 21461070272 is an apocalyptic number.
1461070272 is a gapful number since it is divisible by the number (12) 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 1461070272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1940128200).
1461070272 is an abundant number, since it is smaller than the sum of its proper divisors (2419186128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1461070272 is a wasteful number, since it uses less digits than its factorization.
1461070272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28573 (or 28563 counting only the distinct ones).
The product of its (nonzero) digits is 4704, while the sum is 30.
The square root of 1461070272 is about 38223.9489325737. The cubic root of 1461070272 is about 1134.7243334221.
The spelling of 1461070272 in words is "one billion, four hundred sixty-one million, seventy thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •