Base | Representation |
---|---|
bin | 1011111100001001… |
… | …1001000010110010 |
3 | 22021100220200112000 |
4 | 2333002121002302 |
5 | 23030444400442 |
6 | 1250011514430 |
7 | 142265455224 |
oct | 27702310262 |
9 | 8240820460 |
10 | 3205075122 |
11 | 13a51aa417 |
12 | 755458a16 |
13 | 3c1027872 |
14 | 22594a414 |
15 | 13b5a1d4c |
hex | bf0990b2 |
3205075122 has 32 divisors (see below), whose sum is σ = 7125677760. Its totient is φ = 1067865120.
The previous prime is 3205075121. The next prime is 3205075123. The reversal of 3205075122 is 2215705023.
3205075122 is a `hidden beast` number, since 32 + 0 + 507 + 5 + 122 = 666.
It is an interprime number because it is at equal distance from previous prime (3205075121) and next prime (3205075123).
It is a super-3 number, since 3×32050751223 (a number of 29 digits) contains 333 as substring.
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 (3205075121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115518 + ... + 140550.
It is an arithmetic number, because the mean of its divisors is an integer number (222677430).
Almost surely, 23205075122 is an apocalyptic number.
3205075122 is an abundant number, since it is smaller than the sum of its proper divisors (3920602638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3205075122 is a wasteful number, since it uses less digits than its factorization.
3205075122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27415 (or 27409 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 3205075122 is about 56613.3828877943. The cubic root of 3205075122 is about 1474.3912258614.
The spelling of 3205075122 in words is "three billion, two hundred five million, seventy-five thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •