Base | Representation |
---|---|
bin | 100101101111100111100011… |
… | …0010000000011010100111001 |
3 | 1121112111220001001100012200221 |
4 | 1023133033012100003110321 |
5 | 322003442001244011301 |
6 | 3134034410151100041 |
7 | 126634131401130106 |
oct | 11337170620032471 |
9 | 1545456031305627 |
10 | 332000003110201 |
11 | 96870457596078 |
12 | 3129b9a9371621 |
13 | 11333609926c8a |
14 | 5bdac58c41aad |
15 | 285b136a2bda1 |
hex | 12df3c6403539 |
332000003110201 has 2 divisors, whose sum is σ = 332000003110202. Its totient is φ = 332000003110200.
The previous prime is 332000003110177. The next prime is 332000003110247. The reversal of 332000003110201 is 102011300000233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 325036764058176 + 6963239052025 = 18028776^2 + 2638795^2 .
It is a cyclic number.
It is not a de Polignac number, because 332000003110201 - 29 = 332000003109689 is a prime.
It is a super-2 number, since 2×3320000031102012 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (332000003110301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166000001555100 + 166000001555101.
It is an arithmetic number, because the mean of its divisors is an integer number (166000001555101).
Almost surely, 2332000003110201 is an apocalyptic number.
It is an amenable number.
332000003110201 is a deficient number, since it is larger than the sum of its proper divisors (1).
332000003110201 is an equidigital number, since it uses as much as digits as its factorization.
332000003110201 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 332000003110201 its reverse (102011300000233), we get a palindrome (434011303110434).
The spelling of 332000003110201 in words is "three hundred thirty-two trillion, three million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •