Base | Representation |
---|---|
bin | 111110011110000… |
… | …1011110000000001 |
3 | 12102002021112100201 |
4 | 1330330023300001 |
5 | 13243103322203 |
6 | 543555445201 |
7 | 102641665006 |
oct | 17474136001 |
9 | 5362245321 |
10 | 2096151553 |
11 | 98624a761 |
12 | 4a5bb6801 |
13 | 275371282 |
14 | 15c5678ad |
15 | c4056e1d |
hex | 7cf0bc01 |
2096151553 has 4 divisors (see below), whose sum is σ = 2111231920. Its totient is φ = 2081071188.
The previous prime is 2096151539. The next prime is 2096151569. The reversal of 2096151553 is 3551516902.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3551516902 = 2 ⋅1775758451.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2096151553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2096151053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7539975 + ... + 7540252.
It is an arithmetic number, because the mean of its divisors is an integer number (527807980).
Almost surely, 22096151553 is an apocalyptic number.
It is an amenable number.
2096151553 is a deficient number, since it is larger than the sum of its proper divisors (15080367).
2096151553 is a wasteful number, since it uses less digits than its factorization.
2096151553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15080366.
The product of its (nonzero) digits is 40500, while the sum is 37.
The square root of 2096151553 is about 45783.7476950064. The cubic root of 2096151553 is about 1279.7964261617.
It can be divided in two parts, 2096151 and 553, that added together give a square (2096704 = 14482).
The spelling of 2096151553 in words is "two billion, ninety-six million, one hundred fifty-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •