Base | Representation |
---|---|
bin | 111000110111010000… |
… | …0111110011010011111 |
3 | 102200012021120102112011 |
4 | 1301232200332122133 |
5 | 4000041441103203 |
6 | 132033102052051 |
7 | 11552036156242 |
oct | 1615640763237 |
9 | 380167512464 |
10 | 122113222303 |
11 | 47873804336 |
12 | 1b7bb57a027 |
13 | b690c54677 |
14 | 5ca5c75259 |
15 | 329a78076d |
hex | 1c6e83e69f |
122113222303 has 4 divisors (see below), whose sum is σ = 123372121600. Its totient is φ = 120854323008.
The previous prime is 122113222277. The next prime is 122113222333. The reversal of 122113222303 is 303222311221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 303222311221 = 61 ⋅4970857561.
It is a cyclic number.
It is not a de Polignac number, because 122113222303 - 25 = 122113222271 is a prime.
It is a super-2 number, since 2×1221132223032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122113222333) 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, 629449503 + ... + 629449696.
It is an arithmetic number, because the mean of its divisors is an integer number (30843030400).
Almost surely, 2122113222303 is an apocalyptic number.
122113222303 is a deficient number, since it is larger than the sum of its proper divisors (1258899297).
122113222303 is an equidigital number, since it uses as much as digits as its factorization.
122113222303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1258899296.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 122113222303 its reverse (303222311221), we get a palindrome (425335533524).
The spelling of 122113222303 in words is "one hundred twenty-two billion, one hundred thirteen million, two hundred twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •