Base | Representation |
---|---|
bin | 1111101100000000… |
… | …1100001011011001 |
3 | 101212110222121212102 |
4 | 3323000030023121 |
5 | 32111022143342 |
6 | 1533511053145 |
7 | 206233011065 |
oct | 37300141331 |
9 | 11773877772 |
10 | 4211131097 |
11 | 187108a138 |
12 | 9963711b5 |
13 | 5215a5364 |
14 | 2bd3d2aa5 |
15 | 199a7c832 |
hex | fb00c2d9 |
4211131097 has 2 divisors, whose sum is σ = 4211131098. Its totient is φ = 4211131096.
The previous prime is 4211131079. The next prime is 4211131147. The reversal of 4211131097 is 7901311124.
Together with previous prime (4211131079) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4006383616 + 204747481 = 63296^2 + 14309^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4211131097 is a prime.
It is a super-3 number, since 3×42111310973 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (4211151097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2105565548 + 2105565549.
It is an arithmetic number, because the mean of its divisors is an integer number (2105565549).
Almost surely, 24211131097 is an apocalyptic number.
It is an amenable number.
4211131097 is a deficient number, since it is larger than the sum of its proper divisors (1).
4211131097 is an equidigital number, since it uses as much as digits as its factorization.
4211131097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 29.
The square root of 4211131097 is about 64893.2284371798. The cubic root of 4211131097 is about 1614.8527244793.
The spelling of 4211131097 in words is "four billion, two hundred eleven million, one hundred thirty-one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •