Base | Representation |
---|---|
bin | 111001000000100110… |
… | …0100000100011011101 |
3 | 102201000010021220010121 |
4 | 1302001030200203131 |
5 | 4001212203433341 |
6 | 132124135234541 |
7 | 11562563064406 |
oct | 1620114404335 |
9 | 381003256117 |
10 | 122426624221 |
11 | 47a14701890 |
12 | 1b888518a51 |
13 | b710b655a5 |
14 | 5cd57369ad |
15 | 32b803a4d1 |
hex | 1c813208dd |
122426624221 has 8 divisors (see below), whose sum is σ = 135437393088. Its totient is φ = 109729368000.
The previous prime is 122426624219. The next prime is 122426624239.
It is a happy number.
122426624221 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122426624221 - 21 = 122426624219 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 (122426624291) 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, 78377340 + ... + 78378901.
It is an arithmetic number, because the mean of its divisors is an integer number (16929674136).
Almost surely, 2122426624221 is an apocalyptic number.
122426624221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122426624221 is a deficient number, since it is larger than the sum of its proper divisors (13010768867).
122426624221 is a wasteful number, since it uses less digits than its factorization.
122426624221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156756323.
The product of its digits is 36864, while the sum is 34.
It can be divided in two parts, 122426 and 624221, that added together give a palindrome (746647).
The spelling of 122426624221 in words is "one hundred twenty-two billion, four hundred twenty-six million, six hundred twenty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •