Base | Representation |
---|---|
bin | 100101100010000000110001… |
… | …0001001111110101111100001 |
3 | 1121021220010021020002020102211 |
4 | 1023010001202021332233201 |
5 | 321232322231313220301 |
6 | 3130043345001442121 |
7 | 126352051322504206 |
oct | 11304014211765741 |
9 | 1537803236066384 |
10 | 330130013023201 |
11 | 9620a396975186 |
12 | 310394a94a0341 |
13 | 11229185328511 |
14 | 5b74540cbbcad |
15 | 282768c6c0051 |
hex | 12c406227ebe1 |
330130013023201 has 2 divisors, whose sum is σ = 330130013023202. Its totient is φ = 330130013023200.
The previous prime is 330130013023199. The next prime is 330130013023211. The reversal of 330130013023201 is 102320310031033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 215521190809600 + 114608822213601 = 14680640^2 + 10705551^2 .
It is a cyclic number.
It is not a de Polignac number, because 330130013023201 - 21 = 330130013023199 is a prime.
Together with 330130013023199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (330130013023211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165065006511600 + 165065006511601.
It is an arithmetic number, because the mean of its divisors is an integer number (165065006511601).
Almost surely, 2330130013023201 is an apocalyptic number.
It is an amenable number.
330130013023201 is a deficient number, since it is larger than the sum of its proper divisors (1).
330130013023201 is an equidigital number, since it uses as much as digits as its factorization.
330130013023201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 330130013023201 its reverse (102320310031033), we get a palindrome (432450323054234).
The spelling of 330130013023201 in words is "three hundred thirty trillion, one hundred thirty billion, thirteen million, twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •