Base | Representation |
---|---|
bin | 1010010000000001101… |
… | …10111010100101101111 |
3 | 1020200002112122212020002 |
4 | 11020000312322211233 |
5 | 21232302114322111 |
6 | 425444345014515 |
7 | 34305613113416 |
oct | 5100066724557 |
9 | 1220075585202 |
10 | 352201714031 |
11 | 12640575a722 |
12 | 5831378443b |
13 | 2729ba801ab |
14 | 1309203847d |
15 | 92654ad63b |
hex | 5200dba96f |
352201714031 has 2 divisors, whose sum is σ = 352201714032. Its totient is φ = 352201714030.
The previous prime is 352201714001. The next prime is 352201714049. The reversal of 352201714031 is 130417102253.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 352201714031 - 210 = 352201713007 is a prime.
It is a super-2 number, since 2×3522017140312 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 352201713985 and 352201714003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (352201714001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 176100857015 + 176100857016.
It is an arithmetic number, because the mean of its divisors is an integer number (176100857016).
Almost surely, 2352201714031 is an apocalyptic number.
352201714031 is a deficient number, since it is larger than the sum of its proper divisors (1).
352201714031 is an equidigital number, since it uses as much as digits as its factorization.
352201714031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 352201714031 its reverse (130417102253), we get a palindrome (482618816284).
The spelling of 352201714031 in words is "three hundred fifty-two billion, two hundred one million, seven hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •