Base | Representation |
---|---|
bin | 100011111101100… |
… | …0010110010100100 |
3 | 10010002112200200202 |
4 | 1013323002302210 |
5 | 4432401112020 |
6 | 315422530032 |
7 | 41621304641 |
oct | 10773026244 |
9 | 3102480622 |
10 | 1206660260 |
11 | 56a145793 |
12 | 298136918 |
13 | 162cb6b70 |
14 | b6384dc8 |
15 | 70e03e75 |
hex | 47ec2ca4 |
1206660260 has 24 divisors (see below), whose sum is σ = 2728909176. Its totient is φ = 445536000.
The previous prime is 1206660241. The next prime is 1206660269. The reversal of 1206660260 is 620666021.
It can be written as a sum of positive squares in 4 ways, for example, as 4096576 + 1202563684 = 2024^2 + 34678^2 .
It is a Smith number, since the sum of its digits (29) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (1206660269) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2320241 + ... + 2320760.
It is an arithmetic number, because the mean of its divisors is an integer number (113704549).
Almost surely, 21206660260 is an apocalyptic number.
1206660260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1206660260 is an abundant number, since it is smaller than the sum of its proper divisors (1522248916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1206660260 is a wasteful number, since it uses less digits than its factorization.
1206660260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4641023 (or 4641021 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 29.
The square root of 1206660260 is about 34737.0157037129. The cubic root of 1206660260 is about 1064.6209382241.
The spelling of 1206660260 in words is "one billion, two hundred six million, six hundred sixty thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •