Base | Representation |
---|---|
bin | 100001101100111100111… |
… | …110001100011000001101 |
3 | 22012102000201222211222112 |
4 | 201230330332030120031 |
5 | 300421142114343013 |
6 | 4531543242353405 |
7 | 326216615545463 |
oct | 41547476143015 |
9 | 8172021884875 |
10 | 2316010309133 |
11 | 81323a494324 |
12 | 314a371bb865 |
13 | 13a525318681 |
14 | 8014a088833 |
15 | 403a101bba8 |
hex | 21b3cf8c60d |
2316010309133 has 2 divisors, whose sum is σ = 2316010309134. Its totient is φ = 2316010309132.
The previous prime is 2316010309099. The next prime is 2316010309147. The reversal of 2316010309133 is 3319030106132.
2316010309133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2077942431049 + 238067878084 = 1441507^2 + 487922^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2316010309133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2316010309133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2316010309433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1158005154566 + 1158005154567.
It is an arithmetic number, because the mean of its divisors is an integer number (1158005154567).
Almost surely, 22316010309133 is an apocalyptic number.
It is an amenable number.
2316010309133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2316010309133 is an equidigital number, since it uses as much as digits as its factorization.
2316010309133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 32.
The spelling of 2316010309133 in words is "two trillion, three hundred sixteen billion, ten million, three hundred nine thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •