Base | Representation |
---|---|
bin | 1000110001100111110… |
… | …0100101001001001101 |
3 | 112102010122222011120212 |
4 | 2030121330211021031 |
5 | 4432223321312131 |
6 | 153131404052205 |
7 | 13614644525534 |
oct | 2143174451115 |
9 | 472118864525 |
10 | 150759166541 |
11 | 58a3368a215 |
12 | 25274b34065 |
13 | 112a7936329 |
14 | 742252b31b |
15 | 3dc558ca2b |
hex | 2319f2524d |
150759166541 has 2 divisors, whose sum is σ = 150759166542. Its totient is φ = 150759166540.
The previous prime is 150759166517. The next prime is 150759166543. The reversal of 150759166541 is 145661957051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122759837641 + 27999328900 = 350371^2 + 167330^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150759166541 is a prime.
It is a super-2 number, since 2×1507591665412 (a number of 23 digits) contains 22 as substring.
Together with 150759166543, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 150759166541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150759166543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75379583270 + 75379583271.
It is an arithmetic number, because the mean of its divisors is an integer number (75379583271).
Almost surely, 2150759166541 is an apocalyptic number.
It is an amenable number.
150759166541 is a deficient number, since it is larger than the sum of its proper divisors (1).
150759166541 is an equidigital number, since it uses as much as digits as its factorization.
150759166541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1134000, while the sum is 50.
The spelling of 150759166541 in words is "one hundred fifty billion, seven hundred fifty-nine million, one hundred sixty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •