Base | Representation |
---|---|
bin | 10000011111011100001… |
… | …101101000101001000000 |
3 | 11000100011121020200122121 |
4 | 100133130031220221000 |
5 | 122031414331220304 |
6 | 2224341213414024 |
7 | 144606340140661 |
oct | 20373415505100 |
9 | 4010147220577 |
10 | 1133270960704 |
11 | 3a7687a05233 |
12 | 16377619a314 |
13 | 82b36a25a7c |
14 | 3cbca0cd368 |
15 | 1e72b843554 |
hex | 107dc368a40 |
1133270960704 has 21 divisors (see below), whose sum is σ = 2248851462537. Its totient is φ = 566631222144.
The previous prime is 1133270960687. The next prime is 1133270960707. The reversal of 1133270960704 is 4070690723311.
The square root of 1133270960704 is 1064552.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1065337751104 + 67933209600 = 1032152^2 + 260640^2 .
It is a super-2 number, since 2×11332709607042 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1133270960707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 8449882 + ... + 8582950.
Almost surely, 21133270960704 is an apocalyptic number.
1133270960704 is the 1064552-nd square number.
It is an amenable number.
1133270960704 is a deficient number, since it is larger than the sum of its proper divisors (1115580501833).
1133270960704 is an frugal number, since it uses more digits than its factorization.
1133270960704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266150 (or 133071 counting only the distinct ones).
The product of its (nonzero) digits is 190512, while the sum is 43.
The spelling of 1133270960704 in words is "one trillion, one hundred thirty-three billion, two hundred seventy million, nine hundred sixty thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •