Base | Representation |
---|---|
bin | 10001011101101100011… |
… | …011110011101111000001 |
3 | 11020201201002022000221200 |
4 | 101131230123303233001 |
5 | 124130313431322310 |
6 | 2315154131411413 |
7 | 152463654035166 |
oct | 21355433635701 |
9 | 4221632260850 |
10 | 1200115104705 |
11 | 422a69764a50 |
12 | 174710153b69 |
13 | 8922a3b96ba |
14 | 4212b92c06d |
15 | 2133ed759c0 |
hex | 1176c6f3bc1 |
1200115104705 has 48 divisors (see below), whose sum is σ = 2269487847744. Its totient is φ = 581828019840.
The previous prime is 1200115104697. The next prime is 1200115104709. The reversal of 1200115104705 is 5074015110021.
It is not a de Polignac number, because 1200115104705 - 23 = 1200115104697 is a prime.
It is a super-2 number, since 2×12001151047052 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1200115104709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6656407 + ... + 6834323.
It is an arithmetic number, because the mean of its divisors is an integer number (47280996828).
Almost surely, 21200115104705 is an apocalyptic number.
1200115104705 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1200115104705 is a deficient number, since it is larger than the sum of its proper divisors (1069372743039).
1200115104705 is a wasteful number, since it uses less digits than its factorization.
1200115104705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191566 (or 191563 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 27.
The spelling of 1200115104705 in words is "one trillion, two hundred billion, one hundred fifteen million, one hundred four thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •