Base | Representation |
---|---|
bin | 111000111001111000… |
… | …0010001110110000101 |
3 | 102200102101222002200100 |
4 | 1301303300101312011 |
5 | 4000231441321013 |
6 | 132045522034313 |
7 | 11554154245161 |
oct | 1616360216605 |
9 | 380371862610 |
10 | 122201120133 |
11 | 4790938a274 |
12 | 1b824aa8999 |
13 | b6a621b811 |
14 | 5cb37d5ca1 |
15 | 32a3344473 |
hex | 1c73c11d85 |
122201120133 has 24 divisors (see below), whose sum is σ = 177625726200. Its totient is φ = 80955287424.
The previous prime is 122201120011. The next prime is 122201120147. The reversal of 122201120133 is 331021102221.
It can be written as a sum of positive squares in 4 ways, for example, as 8701531524 + 113499588609 = 93282^2 + 336897^2 .
It is a de Polignac number, because none of the positive numbers 2k-122201120133 is a prime.
It is a super-2 number, since 2×1222011201332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122201120183) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 876891 + ... + 1006647.
It is an arithmetic number, because the mean of its divisors is an integer number (7401071925).
Almost surely, 2122201120133 is an apocalyptic number.
It is an amenable number.
122201120133 is a deficient number, since it is larger than the sum of its proper divisors (55424606067).
122201120133 is a wasteful number, since it uses less digits than its factorization.
122201120133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130421 (or 130418 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 122201120133 its reverse (331021102221), we get a palindrome (453222222354).
The spelling of 122201120133 in words is "one hundred twenty-two billion, two hundred one million, one hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •