Base | Representation |
---|---|
bin | 111110011110101… |
… | …0100011101011001 |
3 | 12102002211122212221 |
4 | 1330331110131121 |
5 | 13243142334434 |
6 | 544010104041 |
7 | 102644345200 |
oct | 17475243531 |
9 | 5362748787 |
10 | 2096449369 |
11 | 986433493 |
12 | 4a611b021 |
13 | 2754469b1 |
14 | 15c604237 |
15 | c40b52b4 |
hex | 7cf54759 |
2096449369 has 27 divisors (see below), whose sum is σ = 2531932533. Its totient is φ = 1730748600.
The previous prime is 2096449361. The next prime is 2096449373. The reversal of 2096449369 is 9639446902.
The square root of 2096449369 is 45787.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 2096449369 - 23 = 2096449361 is a prime.
It is a super-2 number, since 2×20964493692 = 8790199913560996322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2096449361) 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 26 ways as a sum of consecutive naturals, for example, 9935674 + ... + 9935884.
It is an arithmetic number, because the mean of its divisors is an integer number (93775279).
Almost surely, 22096449369 is an apocalyptic number.
2096449369 is the 45787-th square number.
2096449369 is the 22894-th centered octagonal number.
It is an amenable number.
2096449369 is a deficient number, since it is larger than the sum of its proper divisors (435483164).
2096449369 is an frugal number, since it uses more digits than its factorization.
2096449369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498 (or 249 counting only the distinct ones).
The product of its (nonzero) digits is 2519424, while the sum is 52.
The cubic root of 2096449369 is about 1279.8570333894.
The spelling of 2096449369 in words is "two billion, ninety-six million, four hundred forty-nine thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •