Base | Representation |
---|---|
bin | 111000011100000010… |
… | …1010100100000111010 |
3 | 102120211122012002022211 |
4 | 1300320011110200322 |
5 | 3441204200100010 |
6 | 131402320405334 |
7 | 11520310012543 |
oct | 1607005244072 |
9 | 376748162284 |
10 | 121200003130 |
11 | 47445273248 |
12 | 1b5a577684a |
13 | b5769b00ab |
14 | 5c1a8774ca |
15 | 32454e208a |
hex | 1c3815483a |
121200003130 has 8 divisors (see below), whose sum is σ = 218160005652. Its totient is φ = 48480001248.
The previous prime is 121200003121. The next prime is 121200003139. The reversal of 121200003130 is 31300002121.
It is an interprime number because it is at equal distance from previous prime (121200003121) and next prime (121200003139).
It can be written as a sum of positive squares in 2 ways, for example, as 113695072969 + 7504930161 = 337187^2 + 86631^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 121200003130.
It is not an unprimeable number, because it can be changed into a prime (121200003139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6060000147 + ... + 6060000166.
Almost surely, 2121200003130 is an apocalyptic number.
121200003130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121200003130 is a deficient number, since it is larger than the sum of its proper divisors (96960002522).
121200003130 is a wasteful number, since it uses less digits than its factorization.
121200003130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12120000320.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 121200003130 its reverse (31300002121), we get a palindrome (152500005251).
The spelling of 121200003130 in words is "one hundred twenty-one billion, two hundred million, three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •