Base | Representation |
---|---|
bin | 1011100011110101… |
… | …1100000010111001 |
3 | 22000021001111022222 |
4 | 2320331130002321 |
5 | 22323344112101 |
6 | 1231530253425 |
7 | 136620012563 |
oct | 27075340271 |
9 | 8007044288 |
10 | 3103113401 |
11 | 1352699033 |
12 | 727287275 |
13 | 3a5b7819b |
14 | 2161a8333 |
15 | 13266101b |
hex | b8f5c0b9 |
3103113401 has 2 divisors, whose sum is σ = 3103113402. Its totient is φ = 3103113400.
The previous prime is 3103113389. The next prime is 3103113407. The reversal of 3103113401 is 1043113013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1742979001 + 1360134400 = 41749^2 + 36880^2 .
It is a cyclic number.
It is not a de Polignac number, because 3103113401 - 26 = 3103113337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3103113401.
It is not a weakly prime, because it can be changed into another prime (3103113407) 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, 1551556700 + 1551556701.
It is an arithmetic number, because the mean of its divisors is an integer number (1551556701).
Almost surely, 23103113401 is an apocalyptic number.
It is an amenable number.
3103113401 is a deficient number, since it is larger than the sum of its proper divisors (1).
3103113401 is an equidigital number, since it uses as much as digits as its factorization.
3103113401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 3103113401 is about 55705.5957781622. The cubic root of 3103113401 is about 1458.5877068230.
Adding to 3103113401 its reverse (1043113013), we get a palindrome (4146226414).
The spelling of 3103113401 in words is "three billion, one hundred three million, one hundred thirteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •