Base | Representation |
---|---|
bin | 1001101010011111011… |
… | …11110001101100111001 |
3 | 1011202002011102100122122 |
4 | 10311033233301230321 |
5 | 20420014400444301 |
6 | 412313012331025 |
7 | 32663342612003 |
oct | 4651757615471 |
9 | 1152064370578 |
10 | 332050406201 |
11 | 118904885908 |
12 | 5442b013a75 |
13 | 25409c392c7 |
14 | 120dda07373 |
15 | 898630581b |
hex | 4d4fbf1b39 |
332050406201 has 2 divisors, whose sum is σ = 332050406202. Its totient is φ = 332050406200.
The previous prime is 332050406189. The next prime is 332050406227. The reversal of 332050406201 is 102604050233.
It is an a-pointer prime, because the next prime (332050406227) can be obtained adding 332050406201 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 282811240000 + 49239166201 = 531800^2 + 221899^2 .
It is a cyclic number.
It is not a de Polignac number, because 332050406201 - 218 = 332050144057 is a prime.
It is a super-2 number, since 2×3320504062012 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (332050406231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166025203100 + 166025203101.
It is an arithmetic number, because the mean of its divisors is an integer number (166025203101).
Almost surely, 2332050406201 is an apocalyptic number.
It is an amenable number.
332050406201 is a deficient number, since it is larger than the sum of its proper divisors (1).
332050406201 is an equidigital number, since it uses as much as digits as its factorization.
332050406201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 332050406201 its reverse (102604050233), we get a palindrome (434654456434).
The spelling of 332050406201 in words is "three hundred thirty-two billion, fifty million, four hundred six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •