Base | Representation |
---|---|
bin | 110000010100111100011… |
… | …010001100110110001100 |
3 | 102202111010211002120221221 |
4 | 300110330122030312030 |
5 | 413402423421034012 |
6 | 11021353525133124 |
7 | 461636023420351 |
oct | 60247432146614 |
9 | 12674124076857 |
10 | 3321023221132 |
11 | 10704900361a1 |
12 | 457777b5a1a4 |
13 | 1b122c013c16 |
14 | b6a4a194628 |
15 | 5b5c28da507 |
hex | 3053c68cd8c |
3321023221132 has 24 divisors (see below), whose sum is σ = 6013796564160. Its totient is φ = 1602826095360.
The previous prime is 3321023221081. The next prime is 3321023221133. The reversal of 3321023221132 is 2311223201233.
It is a super-2 number, since 2×33210232211322 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3321023221097 and 3321023221106.
It is not an unprimeable number, because it can be changed into a prime (3321023221133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3369828 + ... + 4242379.
It is an arithmetic number, because the mean of its divisors is an integer number (250574856840).
Almost surely, 23321023221132 is an apocalyptic number.
It is an amenable number.
3321023221132 is a deficient number, since it is larger than the sum of its proper divisors (2692773343028).
3321023221132 is a wasteful number, since it uses less digits than its factorization.
3321023221132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7616001 (or 7615999 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 3321023221132 its reverse (2311223201233), we get a palindrome (5632246422365).
The spelling of 3321023221132 in words is "three trillion, three hundred twenty-one billion, twenty-three million, two hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •