Base | Representation |
---|---|
bin | 111000110100001110… |
… | …0101010110011010101 |
3 | 102122221012000211212121 |
4 | 1301220130222303111 |
5 | 3444334411230401 |
6 | 132015024215541 |
7 | 11546362021051 |
oct | 1615034526325 |
9 | 378835024777 |
10 | 122011430101 |
11 | 478212a9350 |
12 | 1b79146a5b1 |
13 | b675b341b2 |
14 | 5c96538c61 |
15 | 3291874ca1 |
hex | 1c6872acd5 |
122011430101 has 8 divisors (see below), whose sum is σ = 138890481984. Its totient is φ = 106096895520.
The previous prime is 122011430083. The next prime is 122011430141. The reversal of 122011430101 is 101034110221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122011430101 - 231 = 119863946453 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122011430141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 241129056 + ... + 241129561.
It is an arithmetic number, because the mean of its divisors is an integer number (17361310248).
Almost surely, 2122011430101 is an apocalyptic number.
122011430101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122011430101 is a deficient number, since it is larger than the sum of its proper divisors (16879051883).
122011430101 is a wasteful number, since it uses less digits than its factorization.
122011430101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482258651.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 122011430101 its reverse (101034110221), we get a palindrome (223045540322).
The spelling of 122011430101 in words is "one hundred twenty-two billion, eleven million, four hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •