Base | Representation |
---|---|
bin | 110111111111110110… |
… | …1011101001100110101 |
3 | 102111101201112111002221 |
4 | 1233333231131030311 |
5 | 3432240040120112 |
6 | 131124413202341 |
7 | 11455004013535 |
oct | 1577755351465 |
9 | 374351474087 |
10 | 120254223157 |
11 | 46aaa412802 |
12 | 1b380a903b1 |
13 | b455a78083 |
14 | 5b6b0014c5 |
15 | 31dc470e07 |
hex | 1bffb5d335 |
120254223157 has 2 divisors, whose sum is σ = 120254223158. Its totient is φ = 120254223156.
The previous prime is 120254223101. The next prime is 120254223197. The reversal of 120254223157 is 751322452021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93661093681 + 26593129476 = 306041^2 + 163074^2 .
It is an emirp because it is prime and its reverse (751322452021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120254223157 - 219 = 120253698869 is a prime.
It is a super-2 number, since 2×1202542231572 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120254223197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60127111578 + 60127111579.
It is an arithmetic number, because the mean of its divisors is an integer number (60127111579).
Almost surely, 2120254223157 is an apocalyptic number.
It is an amenable number.
120254223157 is a deficient number, since it is larger than the sum of its proper divisors (1).
120254223157 is an equidigital number, since it uses as much as digits as its factorization.
120254223157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 33600, while the sum is 34.
Adding to 120254223157 its reverse (751322452021), we get a palindrome (871576675178).
The spelling of 120254223157 in words is "one hundred twenty billion, two hundred fifty-four million, two hundred twenty-three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •