Base | Representation |
---|---|
bin | 100101100001010011001000… |
… | …1011000000111011001010001 |
3 | 1121021112202022222211012020121 |
4 | 1023002212101120013121101 |
5 | 321224221034334310001 |
6 | 3125530341204510241 |
7 | 126342012100233502 |
oct | 11302462130073121 |
9 | 1537482288735217 |
10 | 330032021010001 |
11 | 96181880a41302 |
12 | 310225000ab381 |
13 | 1121cb6982b55b |
14 | 5b6d8c67d4ba9 |
15 | 2824d548c46a1 |
hex | 12c2991607651 |
330032021010001 has 2 divisors, whose sum is σ = 330032021010002. Its totient is φ = 330032021010000.
The previous prime is 330032021009987. The next prime is 330032021010011. The reversal of 330032021010001 is 100010120230033.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 327748298592400 + 2283722417601 = 18103820^2 + 1511199^2 .
It is a cyclic number.
It is not a de Polignac number, because 330032021010001 - 25 = 330032021009969 is a prime.
It is a super-2 number, since 2×3300320210100012 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (330032021010011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165016010505000 + 165016010505001.
It is an arithmetic number, because the mean of its divisors is an integer number (165016010505001).
Almost surely, 2330032021010001 is an apocalyptic number.
It is an amenable number.
330032021010001 is a deficient number, since it is larger than the sum of its proper divisors (1).
330032021010001 is an equidigital number, since it uses as much as digits as its factorization.
330032021010001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 330032021010001 its reverse (100010120230033), we get a palindrome (430042141240034).
The spelling of 330032021010001 in words is "three hundred thirty trillion, thirty-two billion, twenty-one million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •