Base | Representation |
---|---|
bin | 1001000001110011001… |
… | …0111011000011001001 |
3 | 112211100022122121021112 |
4 | 2100130302323003021 |
5 | 10020122043340034 |
6 | 155130340420105 |
7 | 14130366453506 |
oct | 2203462730311 |
9 | 484308577245 |
10 | 155101933769 |
11 | 5a861aa8542 |
12 | 260873a7635 |
13 | 1181a57aa93 |
14 | 77151c84ad |
15 | 407b96d7ce |
hex | 241ccbb0c9 |
155101933769 has 2 divisors, whose sum is σ = 155101933770. Its totient is φ = 155101933768.
The previous prime is 155101933757. The next prime is 155101933801. The reversal of 155101933769 is 967339101551.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81341892025 + 73760041744 = 285205^2 + 271588^2 .
It is an emirp because it is prime and its reverse (967339101551) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 155101933769 - 220 = 155100885193 is a prime.
It is a super-2 number, since 2×1551019337692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (155101933709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77550966884 + 77550966885.
It is an arithmetic number, because the mean of its divisors is an integer number (77550966885).
Almost surely, 2155101933769 is an apocalyptic number.
It is an amenable number.
155101933769 is a deficient number, since it is larger than the sum of its proper divisors (1).
155101933769 is an equidigital number, since it uses as much as digits as its factorization.
155101933769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 765450, while the sum is 50.
The spelling of 155101933769 in words is "one hundred fifty-five billion, one hundred one million, nine hundred thirty-three thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •