Base | Representation |
---|---|
bin | 100000101110001… |
… | …0101001000110101 |
3 | 2211111222102021211 |
4 | 1001130111020311 |
5 | 4222033230103 |
6 | 300540441421 |
7 | 36131245510 |
oct | 10134251065 |
9 | 2744872254 |
10 | 1097945653 |
11 | 513841902 |
12 | 267849271 |
13 | 1466118ac |
14 | a5b65d77 |
15 | 665cc36d |
hex | 41715235 |
1097945653 has 4 divisors (see below), whose sum is σ = 1254795040. Its totient is φ = 941096268.
The previous prime is 1097945621. The next prime is 1097945657. The reversal of 1097945653 is 3565497901.
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.
It is not a de Polignac number, because 1097945653 - 25 = 1097945621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1097945597 and 1097945606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1097945657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78424683 + ... + 78424696.
It is an arithmetic number, because the mean of its divisors is an integer number (313698760).
Almost surely, 21097945653 is an apocalyptic number.
It is an amenable number.
1097945653 is a deficient number, since it is larger than the sum of its proper divisors (156849387).
1097945653 is an equidigital number, since it uses as much as digits as its factorization.
1097945653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156849386.
The product of its (nonzero) digits is 1020600, while the sum is 49.
The square root of 1097945653 is about 33135.2629837157. The cubic root of 1097945653 is about 1031.6370902734.
The spelling of 1097945653 in words is "one billion, ninety-seven million, nine hundred forty-five thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •