Base | Representation |
---|---|
bin | 111000110111010000… |
… | …0100011010001011010 |
3 | 102200012021100210000122 |
4 | 1301232200203101122 |
5 | 4000041424024010 |
6 | 132033055433242 |
7 | 11552035214153 |
oct | 1615640432132 |
9 | 380167323018 |
10 | 122113111130 |
11 | 4787373885a |
12 | 1b7bb525822 |
13 | b690c15b9a |
14 | 5ca5c4692a |
15 | 329a75c855 |
hex | 1c6e82345a |
122113111130 has 8 divisors (see below), whose sum is σ = 219803600052. Its totient is φ = 48845244448.
The previous prime is 122113111129. The next prime is 122113111151. The reversal of 122113111130 is 31111311221.
It can be written as a sum of positive squares in 2 ways, for example, as 121025364769 + 1087746361 = 347887^2 + 32981^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1221131111302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122113111099 and 122113111108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6105655547 + ... + 6105655566.
Almost surely, 2122113111130 is an apocalyptic number.
122113111130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122113111130 is a deficient number, since it is larger than the sum of its proper divisors (97690488922).
122113111130 is a wasteful number, since it uses less digits than its factorization.
122113111130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12211311120.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 122113111130 its reverse (31111311221), we get a palindrome (153224422351).
The spelling of 122113111130 in words is "one hundred twenty-two billion, one hundred thirteen million, one hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •