Base | Representation |
---|---|
bin | 111110110111111… |
… | …0000101111111011 |
3 | 12110000201110112102 |
4 | 1331233300233323 |
5 | 13310034004233 |
6 | 545201334015 |
7 | 103164630344 |
oct | 17557605773 |
9 | 5400643472 |
10 | 2109672443 |
11 | 99294514a |
12 | 4aa63730b |
13 | 2780c65b8 |
14 | 1602870cb |
15 | c53281e8 |
hex | 7dbf0bfb |
2109672443 has 4 divisors (see below), whose sum is σ = 2233770840. Its totient is φ = 1985574048.
The previous prime is 2109672421. The next prime is 2109672449. The reversal of 2109672443 is 3442769012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2109672443 - 218 = 2109410299 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2109672397 and 2109672406.
It is not an unprimeable number, because it can be changed into a prime (2109672449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62049173 + ... + 62049206.
It is an arithmetic number, because the mean of its divisors is an integer number (558442710).
Almost surely, 22109672443 is an apocalyptic number.
2109672443 is a deficient number, since it is larger than the sum of its proper divisors (124098397).
2109672443 is a wasteful number, since it uses less digits than its factorization.
2109672443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124098396.
The product of its (nonzero) digits is 72576, while the sum is 38.
The square root of 2109672443 is about 45931.1707122734. The cubic root of 2109672443 is about 1282.5422381077.
It can be divided in two parts, 21096 and 72443, that added together give a palindrome (93539).
The spelling of 2109672443 in words is "two billion, one hundred nine million, six hundred seventy-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.226 sec. • engine limits •