Base | Representation |
---|---|
bin | 100010001010001… |
… | …0000011111111001 |
3 | 2221212201000111210 |
4 | 1010110100133321 |
5 | 4321404124040 |
6 | 305422113333 |
7 | 40255131453 |
oct | 10424203771 |
9 | 2855630453 |
10 | 1146161145 |
11 | 538a83918 |
12 | 27ba1b849 |
13 | 1535c397c |
14 | ac3172d3 |
15 | 6a953480 |
hex | 445107f9 |
1146161145 has 8 divisors (see below), whose sum is σ = 1833857856. Its totient is φ = 611285936.
The previous prime is 1146161141. The next prime is 1146161179. The reversal of 1146161145 is 5411616411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1146161145 - 22 = 1146161141 is a prime.
It is a super-2 number, since 2×11461611452 = 2627370740615422050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1146161141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38205357 + ... + 38205386.
It is an arithmetic number, because the mean of its divisors is an integer number (229232232).
Almost surely, 21146161145 is an apocalyptic number.
1146161145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1146161145 is a deficient number, since it is larger than the sum of its proper divisors (687696711).
1146161145 is an equidigital number, since it uses as much as digits as its factorization.
1146161145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76410751.
The product of its digits is 2880, while the sum is 30.
The square root of 1146161145 is about 33855.0017722640. The cubic root of 1146161145 is about 1046.5224772749.
Adding to 1146161145 its reverse (5411616411), we get a palindrome (6557777556).
The spelling of 1146161145 in words is "one billion, one hundred forty-six million, one hundred sixty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •