Base | Representation |
---|---|
bin | 110000011101100110101… |
… | …110100000011111010100 |
3 | 102210101010221111111210201 |
4 | 300131212232200133110 |
5 | 414031000204402012 |
6 | 11025532422230244 |
7 | 462415340316346 |
oct | 60354656403724 |
9 | 12711127444721 |
10 | 3330323122132 |
11 | 1074422643496 |
12 | 459532585384 |
13 | 1b2081958c16 |
14 | b728d355296 |
15 | 5b9690a6857 |
hex | 30766ba07d4 |
3330323122132 has 24 divisors (see below), whose sum is σ = 6093947293056. Its totient is φ = 1589492649888.
The previous prime is 3330323122127. The next prime is 3330323122141. The reversal of 3330323122132 is 2312213230333.
3330323122132 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×33303231221322 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3330323122132.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37120663 + ... + 37210270.
It is an arithmetic number, because the mean of its divisors is an integer number (253914470544).
Almost surely, 23330323122132 is an apocalyptic number.
It is an amenable number.
3330323122132 is a deficient number, since it is larger than the sum of its proper divisors (2763624170924).
3330323122132 is a wasteful number, since it uses less digits than its factorization.
3330323122132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74331447 (or 74331445 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 3330323122132 its reverse (2312213230333), we get a palindrome (5642536352465).
The spelling of 3330323122132 in words is "three trillion, three hundred thirty billion, three hundred twenty-three million, one hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •