Base | Representation |
---|---|
bin | 11111111100110100001… |
… | …11101100001000000101 |
3 | 10212221121201211110200012 |
4 | 33332122013230020011 |
5 | 120441244401224433 |
6 | 2200153510400005 |
7 | 142212365105456 |
oct | 17763207541005 |
9 | 3787551743605 |
10 | 1097802367493 |
11 | 3936368a9187 |
12 | 158917960005 |
13 | 7c6a36c5400 |
14 | 3b1c368512d |
15 | 1d852aa0848 |
hex | ff9a1ec205 |
1097802367493 has 12 divisors (see below), whose sum is σ = 1188871018020. Its totient is φ = 1013248244736.
The previous prime is 1097802367489. The next prime is 1097802367499. The reversal of 1097802367493 is 3947632087901.
It can be written as a sum of positive squares in 6 ways, for example, as 49027702084 + 1048774665409 = 221422^2 + 1024097^2 .
It is not a de Polignac number, because 1097802367493 - 22 = 1097802367489 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1097802367499) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1270373 + ... + 1951781.
It is an arithmetic number, because the mean of its divisors is an integer number (99072584835).
Almost surely, 21097802367493 is an apocalyptic number.
1097802367493 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1097802367493 is a deficient number, since it is larger than the sum of its proper divisors (91068650527).
1097802367493 is an equidigital number, since it uses as much as digits as its factorization.
1097802367493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690968 (or 690955 counting only the distinct ones).
The product of its (nonzero) digits is 13716864, while the sum is 59.
The spelling of 1097802367493 in words is "one trillion, ninety-seven billion, eight hundred two million, three hundred sixty-seven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •