Base | Representation |
---|---|
bin | 1001100111000100100… |
… | …11001111111111000010 |
3 | 1011120100012022000002022 |
4 | 10303202103033333002 |
5 | 20402234314232042 |
6 | 411410500321442 |
7 | 32600005325516 |
oct | 4634223177702 |
9 | 1146305260068 |
10 | 330214211522 |
11 | 11805234a648 |
12 | 53bb80a3282 |
13 | 251a66b5790 |
14 | 11da7bcc146 |
15 | 88c9eeccd2 |
hex | 4ce24cffc2 |
330214211522 has 8 divisors (see below), whose sum is σ = 533422957116. Its totient is φ = 152406559152.
The previous prime is 330214211461. The next prime is 330214211527. The reversal of 330214211522 is 225112412033.
It can be written as a sum of positive squares in 2 ways, for example, as 302292135721 + 27922075801 = 549811^2 + 167099^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 12700546597 = 330214211522 / (3 + 3 + 0 + 2 + 1 + 4 + 2 + 1 + 1 + 5 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 330214211491 and 330214211500.
It is not an unprimeable number, because it can be changed into a prime (330214211527) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6350273273 + ... + 6350273324.
Almost surely, 2330214211522 is an apocalyptic number.
330214211522 is a deficient number, since it is larger than the sum of its proper divisors (203208745594).
330214211522 is a wasteful number, since it uses less digits than its factorization.
330214211522 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12700546612.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 330214211522 its reverse (225112412033), we get a palindrome (555326623555).
The spelling of 330214211522 in words is "three hundred thirty billion, two hundred fourteen million, two hundred eleven thousand, five hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •