Base | Representation |
---|---|
bin | 1010001110011100001… |
… | …10110110010111110001 |
3 | 1020120220012111011022212 |
4 | 11013032012312113301 |
5 | 21224031131044131 |
6 | 425224051141505 |
7 | 34245533606024 |
oct | 5071606662761 |
9 | 1216805434285 |
10 | 351350253041 |
11 | 126009070457 |
12 | 581165a4895 |
13 | 2719454cc18 |
14 | 13010d151bb |
15 | 921586da2b |
hex | 51ce1b65f1 |
351350253041 has 2 divisors, whose sum is σ = 351350253042. Its totient is φ = 351350253040.
The previous prime is 351350252983. The next prime is 351350253073. The reversal of 351350253041 is 140352053153.
It is an a-pointer prime, because the next prime (351350253073) can be obtained adding 351350253041 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 331694213041 + 19656040000 = 575929^2 + 140200^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-351350253041 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 351350252989 and 351350253007.
It is not a weakly prime, because it can be changed into another prime (351350255041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 175675126520 + 175675126521.
It is an arithmetic number, because the mean of its divisors is an integer number (175675126521).
Almost surely, 2351350253041 is an apocalyptic number.
It is an amenable number.
351350253041 is a deficient number, since it is larger than the sum of its proper divisors (1).
351350253041 is an equidigital number, since it uses as much as digits as its factorization.
351350253041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 32.
The spelling of 351350253041 in words is "three hundred fifty-one billion, three hundred fifty million, two hundred fifty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •