Base | Representation |
---|---|
bin | 100010001100101101000… |
… | …101100000111001001001 |
3 | 22022200000202101222021112 |
4 | 202030231011200321021 |
5 | 302001003000443311 |
6 | 4555342254420105 |
7 | 331534520263145 |
oct | 42145505407111 |
9 | 8280022358245 |
10 | 2350103531081 |
11 | 8267451a3609 |
12 | 31b570b01635 |
13 | 1407c9711797 |
14 | 81a61d92225 |
15 | 411e918228b |
hex | 2232d160e49 |
2350103531081 has 2 divisors, whose sum is σ = 2350103531082. Its totient is φ = 2350103531080.
The previous prime is 2350103531011. The next prime is 2350103531107. The reversal of 2350103531081 is 1801353010532.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1477403785225 + 872699745856 = 1215485^2 + 934184^2 .
It is a cyclic number.
It is not a de Polignac number, because 2350103531081 - 238 = 2075225624137 is a prime.
It is a super-2 number, since 2×23501035310812 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2350103531011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1175051765540 + 1175051765541.
It is an arithmetic number, because the mean of its divisors is an integer number (1175051765541).
Almost surely, 22350103531081 is an apocalyptic number.
It is an amenable number.
2350103531081 is a deficient number, since it is larger than the sum of its proper divisors (1).
2350103531081 is an equidigital number, since it uses as much as digits as its factorization.
2350103531081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 32.
The spelling of 2350103531081 in words is "two trillion, three hundred fifty billion, one hundred three million, five hundred thirty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •