Base | Representation |
---|---|
bin | 100011110001000… |
… | …0100010111100001 |
3 | 10002122020001201010 |
4 | 1013202010113201 |
5 | 4424212104441 |
6 | 315030331133 |
7 | 41511536034 |
oct | 10742042741 |
9 | 3078201633 |
10 | 1200113121 |
11 | 566483829 |
12 | 295ab9aa9 |
13 | 161833b0c |
14 | b555d01b |
15 | 7055e116 |
hex | 478845e1 |
1200113121 has 8 divisors (see below), whose sum is σ = 1604512384. Its totient is φ = 797894640.
The previous prime is 1200113111. The next prime is 1200113129. The reversal of 1200113121 is 1213110021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1200113121 - 213 = 1200104929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1200113097 and 1200113106.
It is not an unprimeable number, because it can be changed into a prime (1200113129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 543910 + ... + 546111.
It is an arithmetic number, because the mean of its divisors is an integer number (200564048).
Almost surely, 21200113121 is an apocalyptic number.
It is an amenable number.
1200113121 is a deficient number, since it is larger than the sum of its proper divisors (404399263).
1200113121 is a wasteful number, since it uses less digits than its factorization.
1200113121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1090391.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1200113121 is about 34642.6488738953. The cubic root of 1200113121 is about 1062.6919595223.
Adding to 1200113121 its reverse (1213110021), we get a palindrome (2413223142).
The spelling of 1200113121 in words is "one billion, two hundred million, one hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •