Base | Representation |
---|---|
bin | 100101100010101010101110… |
… | …1101011000110000011001101 |
3 | 1121022012201212210002020202220 |
4 | 1023011111131223012003031 |
5 | 321240311312311143041 |
6 | 3130153011235005553 |
7 | 126361421466334656 |
oct | 11305253553060315 |
9 | 1538181783066686 |
10 | 330220132131021 |
11 | 96244631848790 |
12 | 31052a5a1398b9 |
13 | 11234817a215a2 |
14 | 5b78a4d94252d |
15 | 2829bb4227d66 |
hex | 12c555dac60cd |
330220132131021 has 16 divisors (see below), whose sum is σ = 481122062323200. Its totient is φ = 199799300857520.
The previous prime is 330220132130983. The next prime is 330220132131031. The reversal of 330220132131021 is 120131231022033.
It is a cyclic number.
It is not a de Polignac number, because 330220132131021 - 29 = 330220132130509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 330220132130982 and 330220132131000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330220132131031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8352793815 + ... + 8352833348.
It is an arithmetic number, because the mean of its divisors is an integer number (30070128895200).
Almost surely, 2330220132131021 is an apocalyptic number.
It is an amenable number.
330220132131021 is a deficient number, since it is larger than the sum of its proper divisors (150901930192179).
330220132131021 is a wasteful number, since it uses less digits than its factorization.
330220132131021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16705627776.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 330220132131021 its reverse (120131231022033), we get a palindrome (450351363153054).
The spelling of 330220132131021 in words is "three hundred thirty trillion, two hundred twenty billion, one hundred thirty-two million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •