Base | Representation |
---|---|
bin | 100100010111001… |
… | …0100000000111101 |
3 | 10011000211111202201 |
4 | 1020232110000331 |
5 | 4444321201112 |
6 | 321022551501 |
7 | 42143452213 |
oct | 11056240075 |
9 | 3130744681 |
10 | 1220100157 |
11 | 576795341 |
12 | 2a0738591 |
13 | 165a11373 |
14 | b8082cb3 |
15 | 721ab257 |
hex | 48b9403d |
1220100157 has 2 divisors, whose sum is σ = 1220100158. Its totient is φ = 1220100156.
The previous prime is 1220100131. The next prime is 1220100187. The reversal of 1220100157 is 7510010221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1108290681 + 111809476 = 33291^2 + 10574^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220100157 is a prime.
It is a super-2 number, since 2×12201001572 = 2977288786222849298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220100107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610050078 + 610050079.
It is an arithmetic number, because the mean of its divisors is an integer number (610050079).
Almost surely, 21220100157 is an apocalyptic number.
It is an amenable number.
1220100157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220100157 is an equidigital number, since it uses as much as digits as its factorization.
1220100157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 19.
The square root of 1220100157 is about 34929.9321070053. The cubic root of 1220100157 is about 1068.5589699859.
Adding to 1220100157 its reverse (7510010221), we get a palindrome (8730110378).
The spelling of 1220100157 in words is "one billion, two hundred twenty million, one hundred thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •