Base | Representation |
---|---|
bin | 110000001011101110010… |
… | …001010011010101111001 |
3 | 102201112120210211021000110 |
4 | 300023232101103111321 |
5 | 413222134304043001 |
6 | 11013035242454533 |
7 | 461135461302432 |
oct | 60135621232571 |
9 | 12645523737013 |
10 | 3311122331001 |
11 | 106726a264971 |
12 | 455874204449 |
13 | 1b0311a18054 |
14 | b638b270489 |
15 | 5b1e35a83d6 |
hex | 302ee453579 |
3311122331001 has 8 divisors (see below), whose sum is σ = 4517500234720. Its totient is φ = 2156079657312.
The previous prime is 3311122330979. The next prime is 3311122331029. The reversal of 3311122331001 is 1001332211133.
It is a happy number.
3311122331001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3311122331001 - 217 = 3311122199929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3311122331051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12833807356 + ... + 12833807613.
It is an arithmetic number, because the mean of its divisors is an integer number (564687529340).
Almost surely, 23311122331001 is an apocalyptic number.
It is an amenable number.
3311122331001 is a deficient number, since it is larger than the sum of its proper divisors (1206377903719).
3311122331001 is a wasteful number, since it uses less digits than its factorization.
3311122331001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25667615015.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 3311122331001 its reverse (1001332211133), we get a palindrome (4312454542134).
The spelling of 3311122331001 in words is "three trillion, three hundred eleven billion, one hundred twenty-two million, three hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •