Base | Representation |
---|---|
bin | 100011011010001… |
… | …0110110011011101 |
3 | 10001210200020222022 |
4 | 1012310112303131 |
5 | 4413130130023 |
6 | 313521425525 |
7 | 41304636620 |
oct | 10664266335 |
9 | 3053606868 |
10 | 1188130013 |
11 | 55a739734 |
12 | 291a9b2a5 |
13 | 15c1c9715 |
14 | b3b1ddb7 |
15 | 6e4937c8 |
hex | 46d16cdd |
1188130013 has 4 divisors (see below), whose sum is σ = 1357862880. Its totient is φ = 1018397148.
The previous prime is 1188130007. The next prime is 1188130043. The reversal of 1188130013 is 3100318811.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1188130013 - 224 = 1171352797 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1188130043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84866423 + ... + 84866436.
It is an arithmetic number, because the mean of its divisors is an integer number (339465720).
Almost surely, 21188130013 is an apocalyptic number.
It is an amenable number.
1188130013 is a deficient number, since it is larger than the sum of its proper divisors (169732867).
1188130013 is an equidigital number, since it uses as much as digits as its factorization.
1188130013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169732866.
The product of its (nonzero) digits is 576, while the sum is 26.
The square root of 1188130013 is about 34469.2618574869. The cubic root of 1188130013 is about 1059.1431348095.
Adding to 1188130013 its reverse (3100318811), we get a palindrome (4288448824).
The spelling of 1188130013 in words is "one billion, one hundred eighty-eight million, one hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •