Base | Representation |
---|---|
bin | 1100011011001001… |
… | …1010101001111001 |
3 | 22121102120220011210 |
4 | 3012302122221321 |
5 | 23312241331040 |
6 | 1310534513333 |
7 | 145434632421 |
oct | 30662325171 |
9 | 8542526153 |
10 | 3335105145 |
11 | 1461641949 |
12 | 790b05849 |
13 | 411c53bc8 |
14 | 238d17481 |
15 | 147bd9480 |
hex | c6c9aa79 |
3335105145 has 8 divisors (see below), whose sum is σ = 5336168256. Its totient is φ = 1778722736.
The previous prime is 3335105129. The next prime is 3335105161. The reversal of 3335105145 is 5415015333.
It is an interprime number because it is at equal distance from previous prime (3335105129) and next prime (3335105161).
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 3335105145 - 24 = 3335105129 is a prime.
It is a super-2 number, since 2×33351051452 = 22245852656410942050, which contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111170157 + ... + 111170186.
It is an arithmetic number, because the mean of its divisors is an integer number (667021032).
Almost surely, 23335105145 is an apocalyptic number.
It is an amenable number.
3335105145 is a deficient number, since it is larger than the sum of its proper divisors (2001063111).
3335105145 is a wasteful number, since it uses less digits than its factorization.
3335105145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222340351.
The product of its (nonzero) digits is 13500, while the sum is 30.
The square root of 3335105145 is about 57750.3692195989. The cubic root of 3335105145 is about 1494.0662088115.
The spelling of 3335105145 in words is "three billion, three hundred thirty-five million, one hundred five thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •