Base | Representation |
---|---|
bin | 100010001000110… |
… | …1111001010110101 |
3 | 2221211110110001120 |
4 | 1010101233022311 |
5 | 4321222002331 |
6 | 305400014153 |
7 | 40246410066 |
oct | 10421571265 |
9 | 2854413046 |
10 | 1145500341 |
11 | 5386723a7 |
12 | 27b761359 |
13 | 153421c6b |
14 | ac1c456d |
15 | 6a872796 |
hex | 4446f2b5 |
1145500341 has 16 divisors (see below), whose sum is σ = 1622793600. Its totient is φ = 718736064.
The previous prime is 1145500331. The next prime is 1145500351. The reversal of 1145500341 is 1430055411.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1145500331) and next prime (1145500351).
It is not a de Polignac number, because 1145500341 - 26 = 1145500277 is a prime.
It is a super-2 number, since 2×11455003412 = 2624342062462232562, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145500331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24121 + ... + 53598.
It is an arithmetic number, because the mean of its divisors is an integer number (101424600).
Almost surely, 21145500341 is an apocalyptic number.
It is an amenable number.
1145500341 is a deficient number, since it is larger than the sum of its proper divisors (477293259).
1145500341 is an frugal number, since it uses more digits than its factorization.
1145500341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77773 (or 77739 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 1145500341 is about 33845.2410391771. The cubic root of 1145500341 is about 1046.3213190622.
Adding to 1145500341 its reverse (1430055411), we get a palindrome (2575555752).
The spelling of 1145500341 in words is "one billion, one hundred forty-five million, five hundred thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •