Base | Representation |
---|---|
bin | 111000111010101111… |
… | …1101101111100100111 |
3 | 102200111102221021111122 |
4 | 1301311133231330213 |
5 | 4000311431130343 |
6 | 132052444124155 |
7 | 11554660455425 |
oct | 1616537557447 |
9 | 380442837448 |
10 | 122230333223 |
11 | 47923922519 |
12 | 1b83283665b |
13 | b6ac2a957b |
14 | 5cb763c115 |
15 | 32a5bb5068 |
hex | 1c757edf27 |
122230333223 has 4 divisors (see below), whose sum is σ = 122287747440. Its totient is φ = 122172919008.
The previous prime is 122230333207. The next prime is 122230333229. The reversal of 122230333223 is 322333032221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322333032221 = 558223 ⋅577427.
It is a cyclic number.
It is not a de Polignac number, because 122230333223 - 24 = 122230333207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122230333192 and 122230333201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122230333229) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28703915 + ... + 28708172.
It is an arithmetic number, because the mean of its divisors is an integer number (30571936860).
Almost surely, 2122230333223 is an apocalyptic number.
122230333223 is a deficient number, since it is larger than the sum of its proper divisors (57414217).
122230333223 is an equidigital number, since it uses as much as digits as its factorization.
122230333223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57414216.
The product of its (nonzero) digits is 7776, while the sum is 26.
Adding to 122230333223 its reverse (322333032221), we get a palindrome (444563365444).
The spelling of 122230333223 in words is "one hundred twenty-two billion, two hundred thirty million, three hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •