Base | Representation |
---|---|
bin | 10001100011110101011… |
… | …100111010101000110001 |
3 | 11021100201121120112201101 |
4 | 101203311130322220301 |
5 | 124232314430403014 |
6 | 2322204314204401 |
7 | 153116240624200 |
oct | 21436534725061 |
9 | 4240647515641 |
10 | 1206708841009 |
11 | 4258427556a1 |
12 | 175a50423701 |
13 | 89a3b49a009 |
14 | 42595533237 |
15 | 215c8b90474 |
hex | 118f573aa31 |
1206708841009 has 27 divisors (see below), whose sum is σ = 1467622582713. Its totient is φ = 989206345512.
The previous prime is 1206708841007. The next prime is 1206708841043. The reversal of 1206708841009 is 9001488076021.
The square root of 1206708841009 is 1098503.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 1206708841009 - 21 = 1206708841007 is a prime.
It is a super-2 number, since 2×12067088410092 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1206708841009.
It is not an unprimeable number, because it can be changed into a prime (1206708841007) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 176855572 + ... + 176862394.
Almost surely, 21206708841009 is an apocalyptic number.
1206708841009 is the 1098503-rd square number.
1206708841009 is the 549252-nd centered octagonal number.
It is an amenable number.
1206708841009 is a deficient number, since it is larger than the sum of its proper divisors (260913741704).
1206708841009 is an frugal number, since it uses more digits than its factorization.
1206708841009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13706 (or 6853 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 46.
The spelling of 1206708841009 in words is "one trillion, two hundred six billion, seven hundred eight million, eight hundred forty-one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •