Base | Representation |
---|---|
bin | 110000101000101100100… |
… | …100110011100111101011 |
3 | 102211111212220220122002111 |
4 | 300220230210303213223 |
5 | 414224342443334121 |
6 | 11035222251343151 |
7 | 463316430452200 |
oct | 60505444634753 |
9 | 12744786818074 |
10 | 3342232402411 |
11 | 1079484071a91 |
12 | 45b8b6a51ab7 |
13 | 1b322c079026 |
14 | b7a9ccb9ca7 |
15 | 5be148a72e1 |
hex | 30a2c9339eb |
3342232402411 has 24 divisors (see below), whose sum is σ = 3905738796960. Its totient is φ = 2851651377792.
The previous prime is 3342232402403. The next prime is 3342232402433. The reversal of 3342232402411 is 1142042322433.
3342232402411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3342232402411 - 23 = 3342232402403 is a prime.
It is a super-2 number, since 2×33422324024112 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3342232402451) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12168130 + ... + 12439768.
It is an arithmetic number, because the mean of its divisors is an integer number (162739116540).
Almost surely, 23342232402411 is an apocalyptic number.
3342232402411 is a deficient number, since it is larger than the sum of its proper divisors (563506394549).
3342232402411 is a wasteful number, since it uses less digits than its factorization.
3342232402411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272803 (or 272796 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 3342232402411 its reverse (1142042322433), we get a palindrome (4484274724844).
The spelling of 3342232402411 in words is "three trillion, three hundred forty-two billion, two hundred thirty-two million, four hundred two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •