Base | Representation |
---|---|
bin | 100000100101000… |
… | …0101001111110001 |
3 | 2211011222101022100 |
4 | 1001022011033301 |
5 | 4214322140334 |
6 | 300250131013 |
7 | 36042503064 |
oct | 10112051761 |
9 | 2734871270 |
10 | 1093161969 |
11 | 511074849 |
12 | 266120a69 |
13 | 145628403 |
14 | a527c8db |
15 | 65e84c99 |
hex | 412853f1 |
1093161969 has 27 divisors (see below), whose sum is σ = 1609531833. Its totient is φ = 714954312.
The previous prime is 1093161961. The next prime is 1093161973. The reversal of 1093161969 is 9691613901.
The square root of 1093161969 is 33063.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 1093161969 - 23 = 1093161961 is a prime.
It is a super-2 number, since 2×10931619692 = 2390006180935913922, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1093161961) 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 26 ways as a sum of consecutive naturals, for example, 10216414 + ... + 10216520.
Almost surely, 21093161969 is an apocalyptic number.
1093161969 is the 33063-rd square number.
1093161969 is the 16532-nd centered octagonal number.
It is an amenable number.
1093161969 is a deficient number, since it is larger than the sum of its proper divisors (516369864).
1093161969 is an equidigital number, since it uses as much as digits as its factorization.
1093161969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426 (or 213 counting only the distinct ones).
The product of its (nonzero) digits is 78732, while the sum is 45.
The cubic root of 1093161969 is about 1030.1366485369.
It can be divided in two parts, 10931 and 61969, that added together give a square (72900 = 2702).
The spelling of 1093161969 in words is "one billion, ninety-three million, one hundred sixty-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •