Base | Representation |
---|---|
bin | 1001010011100010100111… |
… | …0011110100101101000111 |
3 | 1100020002210211111002202111 |
4 | 2110320221303310231013 |
5 | 2320112212232101101 |
6 | 33432111153121451 |
7 | 2104121326154401 |
oct | 224705163645507 |
9 | 40202724432674 |
10 | 10231313550151 |
11 | 3295091850991 |
12 | 1192a92259287 |
13 | 592a68a101a5 |
14 | 2752abca5b71 |
15 | 12b2174ab251 |
hex | 94e29cf4b47 |
10231313550151 has 2 divisors, whose sum is σ = 10231313550152. Its totient is φ = 10231313550150.
The previous prime is 10231313550091. The next prime is 10231313550173. The reversal of 10231313550151 is 15105531313201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10231313550151 - 213 = 10231313541959 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10231313554151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5115656775075 + 5115656775076.
It is an arithmetic number, because the mean of its divisors is an integer number (5115656775076).
Almost surely, 210231313550151 is an apocalyptic number.
10231313550151 is a deficient number, since it is larger than the sum of its proper divisors (1).
10231313550151 is an equidigital number, since it uses as much as digits as its factorization.
10231313550151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6750, while the sum is 31.
Adding to 10231313550151 its reverse (15105531313201), we get a palindrome (25336844863352).
The spelling of 10231313550151 in words is "ten trillion, two hundred thirty-one billion, three hundred thirteen million, five hundred fifty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •