Base | Representation |
---|---|
bin | 100100010111001… |
… | …0101101110010101 |
3 | 10011000211212100222 |
4 | 1020232111232111 |
5 | 4444321412112 |
6 | 321023044125 |
7 | 42143511503 |
oct | 11056255625 |
9 | 3130755328 |
10 | 1220107157 |
11 | 57679a625 |
12 | 2a0740645 |
13 | 165a145c9 |
14 | b8085673 |
15 | 721ad372 |
hex | 48b95b95 |
1220107157 has 4 divisors (see below), whose sum is σ = 1220330976. Its totient is φ = 1219883340.
The previous prime is 1220107099. The next prime is 1220107159. The reversal of 1220107157 is 7517010221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1220107157 - 212 = 1220103061 is a prime.
It is a super-2 number, since 2×12201071572 = 2977322949125245298, which 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 (1220107159) 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, 103523 + ... + 114704.
It is an arithmetic number, because the mean of its divisors is an integer number (305082744).
Almost surely, 21220107157 is an apocalyptic number.
It is an amenable number.
1220107157 is a deficient number, since it is larger than the sum of its proper divisors (223819).
1220107157 is an equidigital number, since it uses as much as digits as its factorization.
1220107157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 223818.
The product of its (nonzero) digits is 980, while the sum is 26.
The square root of 1220107157 is about 34930.0323074571. The cubic root of 1220107157 is about 1068.5610135063.
Adding to 1220107157 its reverse (7517010221), we get a palindrome (8737117378).
The spelling of 1220107157 in words is "one billion, two hundred twenty million, one hundred seven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •