Base | Representation |
---|---|
bin | 100101100011011001110011… |
… | …0101000010010010011111110 |
3 | 1121022120101210100200101112110 |
4 | 1023012303212220102103332 |
5 | 321243440321303334324 |
6 | 3130311245412514450 |
7 | 126401630422146561 |
oct | 11306634650222376 |
9 | 1538511710611473 |
10 | 330321214121214 |
11 | 96283492a08058 |
12 | 3106a56a31ba26 |
13 | 112412067473c4 |
14 | 5b7d8bc5744d8 |
15 | 282c62d43c329 |
hex | 12c6ce6a124fe |
330321214121214 has 8 divisors (see below), whose sum is σ = 660642428242440. Its totient is φ = 110107071373736.
The previous prime is 330321214121189. The next prime is 330321214121251. The reversal of 330321214121214 is 412121412123033.
It is a sphenic number, since it is the product of 3 distinct primes.
330321214121214 is an admirable number.
It is a super-2 number, since 2×3303212141212142 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27526767843429 + ... + 27526767843440.
It is an arithmetic number, because the mean of its divisors is an integer number (82580303530305).
Almost surely, 2330321214121214 is an apocalyptic number.
330321214121214 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330321214121214 is a wasteful number, since it uses less digits than its factorization.
330321214121214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55053535686874.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 330321214121214 its reverse (412121412123033), we get a palindrome (742442626244247).
The spelling of 330321214121214 in words is "three hundred thirty trillion, three hundred twenty-one billion, two hundred fourteen million, one hundred twenty-one thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •