Base | Representation |
---|---|
bin | 100101100011010000000001… |
… | …0101101001110010010011110 |
3 | 1121022111101120120100210201120 |
4 | 1023012200002231032102132 |
5 | 321243114312321403042 |
6 | 3130253453304551410 |
7 | 126400255061026035 |
oct | 11306400255162236 |
9 | 1538441516323646 |
10 | 330300210341022 |
11 | 96275594913129 |
12 | 31066488182566 |
13 | 1123c23a10aabc |
14 | 5b7c888c3971c |
15 | 282bcee4e4dec |
hex | 12c6802b4e49e |
330300210341022 has 8 divisors (see below), whose sum is σ = 660600420682056. Its totient is φ = 110100070113672.
The previous prime is 330300210341011. The next prime is 330300210341039. The reversal of 330300210341022 is 220143012003033.
It is a sphenic number, since it is the product of 3 distinct primes.
330300210341022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 330300210340983 and 330300210341001.
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, 27525017528413 + ... + 27525017528424.
It is an arithmetic number, because the mean of its divisors is an integer number (82575052585257).
Almost surely, 2330300210341022 is an apocalyptic number.
330300210341022 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.
330300210341022 is a wasteful number, since it uses less digits than its factorization.
330300210341022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55050035056842.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 330300210341022 its reverse (220143012003033), we get a palindrome (550443222344055).
The spelling of 330300210341022 in words is "three hundred thirty trillion, three hundred billion, two hundred ten million, three hundred forty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •