Base | Representation |
---|---|
bin | 100011110101000… |
… | …0010001000010001 |
3 | 10002210011010212212 |
4 | 1013222002020101 |
5 | 4430230413410 |
6 | 315143201505 |
7 | 41535353330 |
oct | 10752021021 |
9 | 3083133785 |
10 | 1202201105 |
11 | 56767a536 |
12 | 296746295 |
13 | 1620b5301 |
14 | b5943d17 |
15 | 70822b05 |
hex | 47a82211 |
1202201105 has 8 divisors (see below), whose sum is σ = 1648732992. Its totient is φ = 824366448.
The previous prime is 1202201089. The next prime is 1202201107. The reversal of 1202201105 is 5011022021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1202201105 - 24 = 1202201089 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1202201105.
It is not an unprimeable number, because it can be changed into a prime (1202201107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17174267 + ... + 17174336.
It is an arithmetic number, because the mean of its divisors is an integer number (206091624).
Almost surely, 21202201105 is an apocalyptic number.
It is an amenable number.
1202201105 is a deficient number, since it is larger than the sum of its proper divisors (446531887).
1202201105 is an equidigital number, since it uses as much as digits as its factorization.
1202201105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34348615.
The product of its (nonzero) digits is 40, while the sum is 14.
The square root of 1202201105 is about 34672.7718101683. The cubic root of 1202201105 is about 1063.3079009672.
Adding to 1202201105 its reverse (5011022021), we get a palindrome (6213223126).
The spelling of 1202201105 in words is "one billion, two hundred two million, two hundred one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •