Base | Representation |
---|---|
bin | 11011101111010111001111… |
… | …101110000110010100111010 |
3 | 120222222021120022022221101222 |
4 | 123233113033232012110322 |
5 | 111442340124414324010 |
6 | 1111250543113312042 |
7 | 34461233030043404 |
oct | 3357271756062472 |
9 | 528867508287358 |
10 | 122002031011130 |
11 | 35967852a12796 |
12 | 11824989405622 |
13 | 530c9856a567a |
14 | 221ad0356bb74 |
15 | e18845abe355 |
hex | 6ef5cfb8653a |
122002031011130 has 64 divisors (see below), whose sum is σ = 228586290071040. Its totient is φ = 46841326631424.
The previous prime is 122002031011127. The next prime is 122002031011151. The reversal of 122002031011130 is 31110130200221.
It is a junction number, because it is equal to n+sod(n) for n = 122002031011099 and 122002031011108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32937854 + ... + 36454166.
It is an arithmetic number, because the mean of its divisors is an integer number (3571660782360).
Almost surely, 2122002031011130 is an apocalyptic number.
122002031011130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122002031011130 is a deficient number, since it is larger than the sum of its proper divisors (106584259059910).
122002031011130 is a wasteful number, since it uses less digits than its factorization.
122002031011130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3517623.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 122002031011130 its reverse (31110130200221), we get a palindrome (153112161211351).
The spelling of 122002031011130 in words is "one hundred twenty-two trillion, two billion, thirty-one million, eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •