Base | Representation |
---|---|
bin | 110000100111001000111… |
… | …110001110001100011110 |
3 | 102211100120110112000212220 |
4 | 300213020332032030132 |
5 | 414212432200441022 |
6 | 11034344355010210 |
7 | 463230136624503 |
oct | 60471076161436 |
9 | 12740513460786 |
10 | 3340561343262 |
11 | 10787a6876570 |
12 | 45b50b299966 |
13 | 1b3023ac3630 |
14 | b7980da94aa |
15 | 5bd67d1d85c |
hex | 309c8f8e31e |
3340561343262 has 32 divisors (see below), whose sum is σ = 7849151130240. Its totient is φ = 934422753120.
The previous prime is 3340561343113. The next prime is 3340561343269. The reversal of 3340561343262 is 2623431650433.
3340561343262 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×33405613432622 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3340561343269) 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, 1946713212 + ... + 1946714927.
It is an arithmetic number, because the mean of its divisors is an integer number (245285972820).
Almost surely, 23340561343262 is an apocalyptic number.
3340561343262 is an abundant number, since it is smaller than the sum of its proper divisors (4508589786978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3340561343262 is a wasteful number, since it uses less digits than its factorization.
3340561343262 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3893428168.
The product of its (nonzero) digits is 933120, while the sum is 42.
Adding to 3340561343262 its reverse (2623431650433), we get a palindrome (5963992993695).
The spelling of 3340561343262 in words is "three trillion, three hundred forty billion, five hundred sixty-one million, three hundred forty-three thousand, two hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •