Base | Representation |
---|---|
bin | 1011010111110011… |
… | …1001111011111101 |
3 | 21212202002021122111 |
4 | 2311330321323331 |
5 | 22222434021140 |
6 | 1222524414021 |
7 | 135435013015 |
oct | 26574717375 |
9 | 7782067574 |
10 | 3052642045 |
11 | 1327156172 |
12 | 7123a7311 |
13 | 39858638b |
14 | 20d5cac45 |
15 | 12cee17ea |
hex | b5f39efd |
3052642045 has 8 divisors (see below), whose sum is σ = 3674042424. Its totient is φ = 2434865664.
The previous prime is 3052642037. The next prime is 3052642067. The reversal of 3052642045 is 5402462503.
It can be written as a sum of positive squares in 4 ways, for example, as 163149529 + 2889492516 = 12773^2 + 53754^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3052642045 - 23 = 3052642037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3052641998 and 3052642016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 904144 + ... + 907513.
It is an arithmetic number, because the mean of its divisors is an integer number (459255303).
Almost surely, 23052642045 is an apocalyptic number.
It is an amenable number.
3052642045 is a deficient number, since it is larger than the sum of its proper divisors (621400379).
3052642045 is a wasteful number, since it uses less digits than its factorization.
3052642045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1811999.
The product of its (nonzero) digits is 28800, while the sum is 31.
The square root of 3052642045 is about 55250.7198595638. The cubic root of 3052642045 is about 1450.6365884941.
The spelling of 3052642045 in words is "three billion, fifty-two million, six hundred forty-two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •