Base | Representation |
---|---|
bin | 10001011101101100101… |
… | …110011111001001001101 |
3 | 11020201201102111210112200 |
4 | 101131230232133021031 |
5 | 124130321210013401 |
6 | 2315154424352113 |
7 | 152464043460330 |
oct | 21355456371115 |
9 | 4221642453480 |
10 | 1200120001101 |
11 | 422a714a975a |
12 | 174711915639 |
13 | 8922b412288 |
14 | 4212c444617 |
15 | 213404e1686 |
hex | 1176cb9f24d |
1200120001101 has 24 divisors (see below), whose sum is σ = 2006228340480. Its totient is φ = 677102059296.
The previous prime is 1200120001061. The next prime is 1200120001147. The reversal of 1200120001101 is 1011000210021.
It is a happy number.
It is not a de Polignac number, because 1200120001101 - 26 = 1200120001037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200120001601) 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 23 ways as a sum of consecutive naturals, for example, 120561630 + ... + 120571583.
It is an arithmetic number, because the mean of its divisors is an integer number (83592847520).
Almost surely, 21200120001101 is an apocalyptic number.
It is an amenable number.
1200120001101 is a deficient number, since it is larger than the sum of its proper divisors (806108339379).
1200120001101 is a wasteful number, since it uses less digits than its factorization.
1200120001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241133305 (or 241133302 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1200120001101 its reverse (1011000210021), we get a palindrome (2211120211122).
The spelling of 1200120001101 in words is "one trillion, two hundred billion, one hundred twenty million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •