Base | Representation |
---|---|
bin | 11011110110101100000000… |
… | …001000000111100110111001 |
3 | 121001202101201202220211120101 |
4 | 123312230000020013212321 |
5 | 112024111431200441441 |
6 | 1112314103254355401 |
7 | 34542501611363164 |
oct | 3366540010074671 |
9 | 531671652824511 |
10 | 122505354312121 |
11 | 3604125788a430 |
12 | 118a643735bb61 |
13 | 53482891a3521 |
14 | 223740dcb4adb |
15 | e269a3359231 |
hex | 6f6b002079b9 |
122505354312121 has 8 divisors (see below), whose sum is σ = 133642712419488. Its totient is φ = 111368080824000.
The previous prime is 122505354312119. The next prime is 122505354312157. The reversal of 122505354312121 is 121213453505221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122505354312121 - 21 = 122505354312119 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122505354312521) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18108675 + ... + 23936056.
It is an arithmetic number, because the mean of its divisors is an integer number (16705339052436).
Almost surely, 2122505354312121 is an apocalyptic number.
122505354312121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122505354312121 is a deficient number, since it is larger than the sum of its proper divisors (11137358107367).
122505354312121 is a wasteful number, since it uses less digits than its factorization.
122505354312121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42309623.
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 122505354312121 in words is "one hundred twenty-two trillion, five hundred five billion, three hundred fifty-four million, three hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •