Base | Representation |
---|---|
bin | 1100111111011001… |
… | …0001101111001101 |
3 | 100000000121122120112 |
4 | 3033312101233031 |
5 | 24120200042031 |
6 | 1334004525405 |
7 | 152261651462 |
oct | 31766215715 |
9 | 10000548515 |
10 | 3487112141 |
11 | 152a424a67 |
12 | 8139b0865 |
13 | 4375a6486 |
14 | 2511a5669 |
15 | 15621362b |
hex | cfd91bcd |
3487112141 has 2 divisors, whose sum is σ = 3487112142. Its totient is φ = 3487112140.
The previous prime is 3487112119. The next prime is 3487112147. The reversal of 3487112141 is 1412117843.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2223594025 + 1263518116 = 47155^2 + 35546^2 .
It is an emirp because it is prime and its reverse (1412117843) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3487112141 - 218 = 3486849997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3487112098 and 3487112107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3487112147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1743556070 + 1743556071.
It is an arithmetic number, because the mean of its divisors is an integer number (1743556071).
Almost surely, 23487112141 is an apocalyptic number.
It is an amenable number.
3487112141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3487112141 is an equidigital number, since it uses as much as digits as its factorization.
3487112141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5376, while the sum is 32.
The square root of 3487112141 is about 59051.7750876297. The cubic root of 3487112141 is about 1516.4286162203.
Adding to 3487112141 its reverse (1412117843), we get a palindrome (4899229984).
The spelling of 3487112141 in words is "three billion, four hundred eighty-seven million, one hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •