Base | Representation |
---|---|
bin | 100010001010010… |
… | …0000100110111011 |
3 | 2221212211101000201 |
4 | 1010110200212323 |
5 | 4321413232011 |
6 | 305423343031 |
7 | 40255525030 |
oct | 10424404673 |
9 | 2855741021 |
10 | 1146227131 |
11 | 539019455 |
12 | 27ba51a77 |
13 | 153617a0a |
14 | ac333387 |
15 | 6a967cc1 |
hex | 445209bb |
1146227131 has 8 divisors (see below), whose sum is σ = 1334690784. Its totient is φ = 963942720.
The previous prime is 1146227129. The next prime is 1146227167. The reversal of 1146227131 is 1317226411.
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 1146227131 - 21 = 1146227129 is a prime.
It is a super-2 number, since 2×11462271312 = 2627673271680982322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1146227131.
It is not an unprimeable number, because it can be changed into a prime (1146227111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1544410 + ... + 1545151.
It is an arithmetic number, because the mean of its divisors is an integer number (166836348).
Almost surely, 21146227131 is an apocalyptic number.
1146227131 is a deficient number, since it is larger than the sum of its proper divisors (188463653).
1146227131 is an equidigital number, since it uses as much as digits as its factorization.
1146227131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3089621.
The product of its digits is 2016, while the sum is 28.
The square root of 1146227131 is about 33855.9762966599. The cubic root of 1146227131 is about 1046.5425601132.
The spelling of 1146227131 in words is "one billion, one hundred forty-six million, two hundred twenty-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •