Base | Representation |
---|---|
bin | 10000001001000101010… |
… | …100001000000110001101 |
3 | 10221001012112210102022212 |
4 | 100021011110020012031 |
5 | 121133233200410232 |
6 | 2205331123120205 |
7 | 143066415251300 |
oct | 20110524100615 |
9 | 3831175712285 |
10 | 1109264466317 |
11 | 398488966727 |
12 | 15ab96513065 |
13 | 807ac2946c7 |
14 | 3b98da82b37 |
15 | 1dcc3ebceb2 |
hex | 1024550818d |
1109264466317 has 6 divisors (see below), whose sum is σ = 1290368869038. Its totient is φ = 950798113944.
The previous prime is 1109264466311. The next prime is 1109264466319. The reversal of 1109264466317 is 7136644629011.
It can be written as a sum of positive squares in only one way, i.e., 1050745953481 + 58518512836 = 1025059^2 + 241906^2 .
It is not a de Polignac number, because 1109264466317 - 24 = 1109264466301 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 (1109264466311) 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 5 ways as a sum of consecutive naturals, for example, 11319025118 + ... + 11319025215.
It is an arithmetic number, because the mean of its divisors is an integer number (215061478173).
Almost surely, 21109264466317 is an apocalyptic number.
It is an amenable number.
1109264466317 is a deficient number, since it is larger than the sum of its proper divisors (181104402721).
1109264466317 is an equidigital number, since it uses as much as digits as its factorization.
1109264466317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22638050347 (or 22638050340 counting only the distinct ones).
The product of its (nonzero) digits is 1306368, while the sum is 50.
The spelling of 1109264466317 in words is "one trillion, one hundred nine billion, two hundred sixty-four million, four hundred sixty-six thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •