Base | Representation |
---|---|
bin | 1011101000101011… |
… | …0101100101110001 |
3 | 22001200020022121002 |
4 | 2322022311211301 |
5 | 22344042344441 |
6 | 1233533211345 |
7 | 140254326356 |
oct | 27212654561 |
9 | 8050208532 |
10 | 3123403121 |
11 | 1363096aa3 |
12 | 732030b55 |
13 | 3aa130437 |
14 | 218b6a62d |
15 | 13431cb9b |
hex | ba2b5971 |
3123403121 has 2 divisors, whose sum is σ = 3123403122. Its totient is φ = 3123403120.
The previous prime is 3123403117. The next prime is 3123403177. The reversal of 3123403121 is 1213043213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2381440000 + 741963121 = 48800^2 + 27239^2 .
It is a cyclic number.
It is not a de Polignac number, because 3123403121 - 22 = 3123403117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3123403093 and 3123403102.
It is not a weakly prime, because it can be changed into another prime (3123403111) 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, 1561701560 + 1561701561.
It is an arithmetic number, because the mean of its divisors is an integer number (1561701561).
Almost surely, 23123403121 is an apocalyptic number.
It is an amenable number.
3123403121 is a deficient number, since it is larger than the sum of its proper divisors (1).
3123403121 is an equidigital number, since it uses as much as digits as its factorization.
3123403121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 3123403121 is about 55887.4146923974. The cubic root of 3123403121 is about 1461.7597972084.
Adding to 3123403121 its reverse (1213043213), we get a palindrome (4336446334).
The spelling of 3123403121 in words is "three billion, one hundred twenty-three million, four hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •