Base | Representation |
---|---|
bin | 110000100000010100001… |
… | …011010001011101101100 |
3 | 102210122122202011202222110 |
4 | 300200110023101131230 |
5 | 414102430134334012 |
6 | 11031133253444020 |
7 | 462550424023425 |
oct | 60402413213554 |
9 | 12718582152873 |
10 | 3333233121132 |
11 | 1075686221842 |
12 | 45a005040610 |
13 | 1b24267bac15 |
14 | b7487a1064c |
15 | 5ba897bd73c |
hex | 308142d176c |
3333233121132 has 24 divisors (see below), whose sum is σ = 7777625711296. Its totient is φ = 1111066026768.
The previous prime is 3333233121091. The next prime is 3333233121193. The reversal of 3333233121132 is 2311213323333.
It is a super-2 number, since 2×33332331211322 (a number of 26 digits) contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a self number, because there is not a number n which added to its sum of digits gives 3333233121132.
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, 229498 + ... + 2592129.
Almost surely, 23333233121132 is an apocalyptic number.
It is an amenable number.
3333233121132 is an abundant number, since it is smaller than the sum of its proper divisors (4444392590164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3333233121132 is a wasteful number, since it uses less digits than its factorization.
3333233121132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2920077 (or 2920075 counting only the distinct ones).
The product of its digits is 17496, while the sum is 30.
Adding to 3333233121132 its reverse (2311213323333), we get a palindrome (5644446444465).
The spelling of 3333233121132 in words is "three trillion, three hundred thirty-three billion, two hundred thirty-three million, one hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •