Base | Representation |
---|---|
bin | 10101100001100… |
… | …100000110010001 |
3 | 221011111210201012 |
4 | 111201210012101 |
5 | 1214421321040 |
6 | 55500020305 |
7 | 11643320261 |
oct | 2541440621 |
9 | 834453635 |
10 | 361120145 |
11 | 17592aa01 |
12 | a0b31695 |
13 | 59a7a879 |
14 | 35d637a1 |
15 | 21a83865 |
hex | 15864191 |
361120145 has 4 divisors (see below), whose sum is σ = 433344180. Its totient is φ = 288896112.
The previous prime is 361120141. The next prime is 361120153. The reversal of 361120145 is 541021163.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 217887121 + 143233024 = 14761^2 + 11968^2 .
It is a cyclic number.
It is not a de Polignac number, because 361120145 - 22 = 361120141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 361120145.
It is not an unprimeable number, because it can be changed into a prime (361120141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36112010 + ... + 36112019.
It is an arithmetic number, because the mean of its divisors is an integer number (108336045).
Almost surely, 2361120145 is an apocalyptic number.
It is an amenable number.
361120145 is a deficient number, since it is larger than the sum of its proper divisors (72224035).
361120145 is an equidigital number, since it uses as much as digits as its factorization.
361120145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72224034.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 361120145 is about 19003.1614475066. The cubic root of 361120145 is about 712.1157184987.
The spelling of 361120145 in words is "three hundred sixty-one million, one hundred twenty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •