Base | Representation |
---|---|
bin | 100101100001010010010101… |
… | …1100101010101101001011110 |
3 | 1121021112120220222021110122120 |
4 | 1023002210223211111221132 |
5 | 321224204040134401342 |
6 | 3125525455520323410 |
7 | 126341621552133315 |
oct | 11302445345255136 |
9 | 1537476828243576 |
10 | 330030313200222 |
11 | 96181084a24568 |
12 | 31022104173566 |
13 | 1121c956a7931b |
14 | 5b6d7a3a7927c |
15 | 2824ca49cbaec |
hex | 12c292b955a5e |
330030313200222 has 8 divisors (see below), whose sum is σ = 660060626400456. Its totient is φ = 110010104400072.
The previous prime is 330030313200169. The next prime is 330030313200241. The reversal of 330030313200222 is 222002313030033.
It is a sphenic number, since it is the product of 3 distinct primes.
330030313200222 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 330030313200192 and 330030313200201.
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, 27502526100013 + ... + 27502526100024.
It is an arithmetic number, because the mean of its divisors is an integer number (82507578300057).
Almost surely, 2330030313200222 is an apocalyptic number.
330030313200222 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.
330030313200222 is a wasteful number, since it uses less digits than its factorization.
330030313200222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55005052200042.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 330030313200222 its reverse (222002313030033), we get a palindrome (552032626230255).
The spelling of 330030313200222 in words is "three hundred thirty trillion, thirty billion, three hundred thirteen million, two hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •