Base | Representation |
---|---|
bin | 111001000110101010… |
… | …0110000101111000001 |
3 | 102201112022012020222000 |
4 | 1302031110300233001 |
5 | 4002121302123431 |
6 | 132200244534213 |
7 | 11600613525645 |
oct | 1621524605701 |
9 | 381468166860 |
10 | 122630114241 |
11 | 48009558958 |
12 | 1b9246b1369 |
13 | b74407229b |
14 | 5d14786c25 |
15 | 32cad339e6 |
hex | 1c8d530bc1 |
122630114241 has 32 divisors (see below), whose sum is σ = 197830416000. Its totient is φ = 74779879104.
The previous prime is 122630114221. The next prime is 122630114263. The reversal of 122630114241 is 142411036221.
122630114241 is a `hidden beast` number, since 1 + 2 + 2 + 630 + 1 + 1 + 4 + 24 + 1 = 666.
It is not a de Polignac number, because 122630114241 - 214 = 122630097857 is a prime.
It is a super-2 number, since 2×1226301142412 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (122630114221) 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 31 ways as a sum of consecutive naturals, for example, 4106590 + ... + 4136343.
It is an arithmetic number, because the mean of its divisors is an integer number (6182200500).
Almost surely, 2122630114241 is an apocalyptic number.
It is an amenable number.
122630114241 is a deficient number, since it is larger than the sum of its proper divisors (75200301759).
122630114241 is a wasteful number, since it uses less digits than its factorization.
122630114241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8242990 (or 8242984 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The spelling of 122630114241 in words is "one hundred twenty-two billion, six hundred thirty million, one hundred fourteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •