Base | Representation |
---|---|
bin | 1100100001010101… |
… | …1010011000000101 |
3 | 22200020102100102020 |
4 | 3020111122120011 |
5 | 23340412300021 |
6 | 1313303033353 |
7 | 146201335563 |
oct | 31025323005 |
9 | 8606370366 |
10 | 3361056261 |
11 | 1475257352 |
12 | 79973b859 |
13 | 41743bcb4 |
14 | 23c550a33 |
15 | 14a1137c6 |
hex | c855a605 |
3361056261 has 8 divisors (see below), whose sum is σ = 4482491904. Its totient is φ = 2240162400.
The previous prime is 3361056241. The next prime is 3361056271. The reversal of 3361056261 is 1626501633.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3361056261 - 27 = 3361056133 is a prime.
It is a super-2 number, since 2×33610562612 = 22593398379214600242, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3361056211) 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, 120741 + ... + 145946.
It is an arithmetic number, because the mean of its divisors is an integer number (560311488).
Almost surely, 23361056261 is an apocalyptic number.
It is an amenable number.
3361056261 is a deficient number, since it is larger than the sum of its proper divisors (1121435643).
3361056261 is a wasteful number, since it uses less digits than its factorization.
3361056261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270891.
The product of its (nonzero) digits is 19440, while the sum is 33.
The square root of 3361056261 is about 57974.6173855421. The cubic root of 3361056261 is about 1497.9314094891.
Adding to 3361056261 its reverse (1626501633), we get a palindrome (4987557894).
The spelling of 3361056261 in words is "three billion, three hundred sixty-one million, fifty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •