Base | Representation |
---|---|
bin | 101011110100011010110… |
… | …001010100010011001000 |
3 | 101122212111011221211012001 |
4 | 223310122301110103020 |
5 | 343313440112212222 |
6 | 10223200321000344 |
7 | 430360603654000 |
oct | 53643261242310 |
9 | 11585434854161 |
10 | 3011221210312 |
11 | a61062964107 |
12 | 407717a830b4 |
13 | 18ac59529b13 |
14 | a5a5b30b000 |
15 | 534de92be27 |
hex | 2bd1ac544c8 |
3011221210312 has 64 divisors (see below), whose sum is σ = 6585413328000. Its totient is φ = 1290305741760.
The previous prime is 3011221210307. The next prime is 3011221210339. The reversal of 3011221210312 is 2130121221103.
It is a super-2 number, since 2×30112212103122 (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 3011221210312.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 16739487 + ... + 16918417.
It is an arithmetic number, because the mean of its divisors is an integer number (102897083250).
Almost surely, 23011221210312 is an apocalyptic number.
It is an amenable number.
3011221210312 is an abundant number, since it is smaller than the sum of its proper divisors (3574192117688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3011221210312 is a wasteful number, since it uses less digits than its factorization.
3011221210312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185091 (or 185073 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 3011221210312 its reverse (2130121221103), we get a palindrome (5141342431415).
The spelling of 3011221210312 in words is "three trillion, eleven billion, two hundred twenty-one million, two hundred ten thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •