Base | Representation |
---|---|
bin | 1011100100010011… |
… | …0000101110001101 |
3 | 22000101200000122222 |
4 | 2321010300232031 |
5 | 22324342024401 |
6 | 1232035345125 |
7 | 136642226432 |
oct | 27104605615 |
9 | 8011600588 |
10 | 3105033101 |
11 | 135378a365 |
12 | 727a521a5 |
13 | 3a639abc1 |
14 | 216547b89 |
15 | 1328dec1b |
hex | b9130b8d |
3105033101 has 2 divisors, whose sum is σ = 3105033102. Its totient is φ = 3105033100.
The previous prime is 3105033089. The next prime is 3105033109. The reversal of 3105033101 is 1013305013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2388667876 + 716365225 = 48874^2 + 26765^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3105033101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3105033101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3105033109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1552516550 + 1552516551.
It is an arithmetic number, because the mean of its divisors is an integer number (1552516551).
Almost surely, 23105033101 is an apocalyptic number.
It is an amenable number.
3105033101 is a deficient number, since it is larger than the sum of its proper divisors (1).
3105033101 is an equidigital number, since it uses as much as digits as its factorization.
3105033101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 17.
The square root of 3105033101 is about 55722.8238785509. The cubic root of 3105033101 is about 1458.8884234746. Note that the first 3 decimals are identical.
Adding to 3105033101 its reverse (1013305013), we get a palindrome (4118338114).
The spelling of 3105033101 in words is "three billion, one hundred five million, thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •