Base | Representation |
---|---|
bin | 100101100011010100100110… |
… | …0001000010101110101111101 |
3 | 1121022112022221001202221020021 |
4 | 1023012221030020111311331 |
5 | 321243244421210334323 |
6 | 3130302200043452141 |
7 | 126401053342545514 |
oct | 11306511410256575 |
9 | 1538468831687207 |
10 | 330310032121213 |
11 | 96279774a70a41 |
12 | 31068369527051 |
13 | 11240143bc8761 |
14 | 5b7d13b44967b |
15 | 282c1c68ec05d |
hex | 12c6a4c215d7d |
330310032121213 has 2 divisors, whose sum is σ = 330310032121214. Its totient is φ = 330310032121212.
The previous prime is 330310032121193. The next prime is 330310032121217. The reversal of 330310032121213 is 312121230013033.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 295384272442009 + 34925759679204 = 17186747^2 + 5909802^2 .
It is a cyclic number.
It is not a de Polignac number, because 330310032121213 - 213 = 330310032113021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330310032121217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165155016060606 + 165155016060607.
It is an arithmetic number, because the mean of its divisors is an integer number (165155016060607).
Almost surely, 2330310032121213 is an apocalyptic number.
It is an amenable number.
330310032121213 is a deficient number, since it is larger than the sum of its proper divisors (1).
330310032121213 is an equidigital number, since it uses as much as digits as its factorization.
330310032121213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 330310032121213 its reverse (312121230013033), we get a palindrome (642431262134246).
The spelling of 330310032121213 in words is "three hundred thirty trillion, three hundred ten billion, thirty-two million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •