Base | Representation |
---|---|
bin | 100010001011010… |
… | …1111010001000001 |
3 | 2221220221001120102 |
4 | 1010112233101001 |
5 | 4322040431312 |
6 | 305444052145 |
7 | 40263510431 |
oct | 10426572101 |
9 | 2856831512 |
10 | 1146811457 |
11 | 539388470 |
12 | 280094055 |
13 | 15379097c |
14 | ac4462c1 |
15 | 6aa30ec2 |
hex | 445af441 |
1146811457 has 8 divisors (see below), whose sum is σ = 1251731712. Its totient is φ = 1042002000.
The previous prime is 1146811447. The next prime is 1146811493. The reversal of 1146811457 is 7541186411.
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 1146811457 - 214 = 1146795073 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1146811457.
It is not an unprimeable number, because it can be changed into a prime (1146811417) 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, 5258 + ... + 48179.
It is an arithmetic number, because the mean of its divisors is an integer number (156466464).
Almost surely, 21146811457 is an apocalyptic number.
It is an amenable number.
1146811457 is a deficient number, since it is larger than the sum of its proper divisors (104920255).
1146811457 is a wasteful number, since it uses less digits than its factorization.
1146811457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55399.
The product of its digits is 26880, while the sum is 38.
The square root of 1146811457 is about 33864.6047813938. The cubic root of 1146811457 is about 1046.7203661014.
Adding to 1146811457 its reverse (7541186411), we get a palindrome (8687997868).
The spelling of 1146811457 in words is "one billion, one hundred forty-six million, eight hundred eleven thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •