Base | Representation |
---|---|
bin | 100111111010000010111010… |
… | …0101110011111111001101101 |
3 | 1201000212200202112010002121021 |
4 | 1033310011310232133321231 |
5 | 332002144344130344013 |
6 | 3242322452030334141 |
7 | 133636513112412043 |
oct | 11764056456377155 |
9 | 1630780675102537 |
10 | 351025340481133 |
11 | a1936013542a9a |
12 | 3345309035a351 |
13 | 120b371702c456 |
14 | 6297a07b40393 |
15 | 2a8ae94760a8d |
hex | 13f4174b9fe6d |
351025340481133 has 2 divisors, whose sum is σ = 351025340481134. Its totient is φ = 351025340481132.
The previous prime is 351025340481091. The next prime is 351025340481149. The reversal of 351025340481133 is 331184043520153.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 223292442078729 + 127732898402404 = 14942973^2 + 11301898^2 .
It is a cyclic number.
It is not a de Polignac number, because 351025340481133 - 29 = 351025340480621 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 351025340481133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (351025340482133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 175512670240566 + 175512670240567.
It is an arithmetic number, because the mean of its divisors is an integer number (175512670240567).
Almost surely, 2351025340481133 is an apocalyptic number.
It is an amenable number.
351025340481133 is a deficient number, since it is larger than the sum of its proper divisors (1).
351025340481133 is an equidigital number, since it uses as much as digits as its factorization.
351025340481133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 518400, while the sum is 43.
The spelling of 351025340481133 in words is "three hundred fifty-one trillion, twenty-five billion, three hundred forty million, four hundred eighty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •