Base | Representation |
---|---|
bin | 1011010111110100… |
… | …0001011111101001 |
3 | 21212202010212010000 |
4 | 2311331001133221 |
5 | 22222441014001 |
6 | 1222525213213 |
7 | 135435202200 |
oct | 26575013751 |
9 | 7782125100 |
10 | 3052673001 |
11 | 1327177454 |
12 | 712401209 |
13 | 3985974b1 |
14 | 20d5d8237 |
15 | 12ceeaa86 |
hex | b5f417e9 |
3052673001 has 45 divisors (see below), whose sum is σ = 5310738279. Its totient is φ = 1742395536.
The previous prime is 3052672979. The next prime is 3052673003. The reversal of 3052673001 is 1003762503.
It is a happy number.
The square root of 3052673001 is 55251.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 2572011225 + 480661776 = 50715^2 + 21924^2 .
It is not a de Polignac number, because 3052673001 - 25 = 3052672969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (3052673003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 3480375 + ... + 3481251.
Almost surely, 23052673001 is an apocalyptic number.
3052673001 is the 55251-st square number.
3052673001 is the 27626-th centered octagonal number.
It is an amenable number.
3052673001 is a deficient number, since it is larger than the sum of its proper divisors (2258065278).
3052673001 is an frugal number, since it uses more digits than its factorization.
3052673001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1780 (or 887 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
The cubic root of 3052673001 is about 1450.6414919792.
The spelling of 3052673001 in words is "three billion, fifty-two million, six hundred seventy-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •