Base | Representation |
---|---|
bin | 111001000110101011… |
… | …0110001011001100101 |
3 | 102201112100012000212222 |
4 | 1302031112301121211 |
5 | 4002121421010003 |
6 | 132200304122125 |
7 | 11600621152301 |
oct | 1621526613145 |
9 | 381470160788 |
10 | 122630641253 |
11 | 480098888aa |
12 | 1b924906345 |
13 | b7441c8123 |
14 | 5d14882d01 |
15 | 32cadd9c38 |
hex | 1c8d5b1665 |
122630641253 has 12 divisors (see below), whose sum is σ = 128272506348. Its totient is φ = 117227246400.
The previous prime is 122630641249. The next prime is 122630641283. The reversal of 122630641253 is 352146036221.
It can be written as a sum of positive squares in 2 ways, for example, as 94548255169 + 28082386084 = 307487^2 + 167578^2 .
It is not a de Polignac number, because 122630641253 - 22 = 122630641249 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122630641223) 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 11 ways as a sum of consecutive naturals, for example, 806603 + ... + 946503.
It is an arithmetic number, because the mean of its divisors is an integer number (10689375529).
Almost surely, 2122630641253 is an apocalyptic number.
It is an amenable number.
122630641253 is a deficient number, since it is larger than the sum of its proper divisors (5641865095).
122630641253 is a wasteful number, since it uses less digits than its factorization.
122630641253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141604 (or 141581 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 122630641253 its reverse (352146036221), we get a palindrome (474776677474).
The spelling of 122630641253 in words is "one hundred twenty-two billion, six hundred thirty million, six hundred forty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •