Base | Representation |
---|---|
bin | 111110011110010… |
… | …1001011111001001 |
3 | 12102002111201102211 |
4 | 1330330221133021 |
5 | 13243121221403 |
6 | 544002225121 |
7 | 102643013056 |
oct | 17474513711 |
9 | 5362451384 |
10 | 2096273353 |
11 | 986323219 |
12 | 4a60551a1 |
13 | 2753b4845 |
14 | 15c59a02d |
15 | c407d06d |
hex | 7cf297c9 |
2096273353 has 4 divisors (see below), whose sum is σ = 2096518788. Its totient is φ = 2096027920.
The previous prime is 2096273327. The next prime is 2096273423. The reversal of 2096273353 is 3533726902.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1642924089 + 453349264 = 40533^2 + 21292^2 .
It is a cyclic number.
It is not a de Polignac number, because 2096273353 - 225 = 2062718921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2096273653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 109426 + ... + 127147.
It is an arithmetic number, because the mean of its divisors is an integer number (524129697).
Almost surely, 22096273353 is an apocalyptic number.
It is an amenable number.
2096273353 is a deficient number, since it is larger than the sum of its proper divisors (245435).
2096273353 is an equidigital number, since it uses as much as digits as its factorization.
2096273353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245434.
The product of its (nonzero) digits is 204120, while the sum is 40.
The square root of 2096273353 is about 45785.0778420218. The cubic root of 2096273353 is about 1279.8212138391.
The spelling of 2096273353 in words is "two billion, ninety-six million, two hundred seventy-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •