Base | Representation |
---|---|
bin | 1010100001011100101… |
… | …11011110110001001001 |
3 | 1021120020101211011010221 |
4 | 11100232113132301021 |
5 | 21410431110111022 |
6 | 434032433510041 |
7 | 35056450103533 |
oct | 5205627366111 |
9 | 1246211734127 |
10 | 361555160137 |
11 | 12a37550a176 |
12 | 5a0a4112321 |
13 | 2812c8220a2 |
14 | 136dc376853 |
15 | 9611704cc7 |
hex | 542e5dec49 |
361555160137 has 2 divisors, whose sum is σ = 361555160138. Its totient is φ = 361555160136.
The previous prime is 361555160123. The next prime is 361555160159. The reversal of 361555160137 is 731061555163.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 219327368976 + 142227791161 = 468324^2 + 377131^2 .
It is an emirp because it is prime and its reverse (731061555163) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 361555160137 - 215 = 361555127369 is a prime.
It is a super-4 number, since 4×3615551601374 (a number of 47 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 361555160093 and 361555160102.
It is not a weakly prime, because it can be changed into another prime (361555160237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 180777580068 + 180777580069.
It is an arithmetic number, because the mean of its divisors is an integer number (180777580069).
Almost surely, 2361555160137 is an apocalyptic number.
It is an amenable number.
361555160137 is a deficient number, since it is larger than the sum of its proper divisors (1).
361555160137 is an equidigital number, since it uses as much as digits as its factorization.
361555160137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 283500, while the sum is 43.
The spelling of 361555160137 in words is "three hundred sixty-one billion, five hundred fifty-five million, one hundred sixty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •