Base | Representation |
---|---|
bin | 100010001010000… |
… | …1001101001001001 |
3 | 2221212122120222210 |
4 | 1010110021221021 |
5 | 4321402224230 |
6 | 305421335333 |
7 | 40254653550 |
oct | 10424115111 |
9 | 2855576883 |
10 | 1146133065 |
11 | 538a64810 |
12 | 27ba07549 |
13 | 1535b3c5c |
14 | ac30ad97 |
15 | 6a949eb0 |
hex | 44509a49 |
1146133065 has 64 divisors (see below), whose sum is σ = 2342172672. Its totient is φ = 464678400.
The previous prime is 1146133063. The next prime is 1146133073. The reversal of 1146133065 is 5603316411.
It is not a de Polignac number, because 1146133065 - 21 = 1146133063 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1146133063) 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 63 ways as a sum of consecutive naturals, for example, 35254 + ... + 59456.
It is an arithmetic number, because the mean of its divisors is an integer number (36596448).
Almost surely, 21146133065 is an apocalyptic number.
1146133065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1146133065 is an abundant number, since it is smaller than the sum of its proper divisors (1196039607).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1146133065 is a wasteful number, since it uses less digits than its factorization.
1146133065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24270.
The product of its (nonzero) digits is 6480, while the sum is 30.
The square root of 1146133065 is about 33854.5870599539. The cubic root of 1146133065 is about 1046.5139308934.
Adding to 1146133065 its reverse (5603316411), we get a palindrome (6749449476).
The spelling of 1146133065 in words is "one billion, one hundred forty-six million, one hundred thirty-three thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •