Base | Representation |
---|---|
bin | 111000110100101101… |
… | …0100010001010011001 |
3 | 102122222022112210011020 |
4 | 1301221122202022121 |
5 | 3444403034211031 |
6 | 132020403553053 |
7 | 11546646614364 |
oct | 1615132421231 |
9 | 378868483136 |
10 | 122027647641 |
11 | 4782a475879 |
12 | 1b79698b789 |
13 | b6792c1a83 |
14 | 5c9875b0db |
15 | 3292eca096 |
hex | 1c696a2299 |
122027647641 has 4 divisors (see below), whose sum is σ = 162703530192. Its totient is φ = 81351765092.
The previous prime is 122027647633. The next prime is 122027647681. The reversal of 122027647641 is 146746720221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 122027647641 - 23 = 122027647633 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 122027647593 and 122027647602.
It is not an unprimeable number, because it can be changed into a prime (122027647601) by changing a digit.
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, 20337941271 + ... + 20337941276.
It is an arithmetic number, because the mean of its divisors is an integer number (40675882548).
Almost surely, 2122027647641 is an apocalyptic number.
It is an amenable number.
122027647641 is a deficient number, since it is larger than the sum of its proper divisors (40675882551).
122027647641 is an equidigital number, since it uses as much as digits as its factorization.
122027647641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40675882550.
The product of its (nonzero) digits is 225792, while the sum is 42.
The spelling of 122027647641 in words is "one hundred twenty-two billion, twenty-seven million, six hundred forty-seven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •