Base | Representation |
---|---|
bin | 111010101001101… |
… | …0010110011001101 |
3 | 12002011010100112002 |
4 | 1311103102303031 |
5 | 13012301221023 |
6 | 523140522045 |
7 | 66524441021 |
oct | 16523226315 |
9 | 5064110462 |
10 | 1967992013 |
11 | 91a975589 |
12 | 46b0b0325 |
13 | 25494b420 |
14 | 149526381 |
15 | b7b8db28 |
hex | 754d2ccd |
1967992013 has 8 divisors (see below), whose sum is σ = 2230922400. Its totient is φ = 1720996848.
The previous prime is 1967992009. The next prime is 1967992021. The reversal of 1967992013 is 3102997691.
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 1967992013 - 22 = 1967992009 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 (1967992093) 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 7 ways as a sum of consecutive naturals, for example, 3983543 + ... + 3984036.
It is an arithmetic number, because the mean of its divisors is an integer number (278865300).
Almost surely, 21967992013 is an apocalyptic number.
1967992013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1967992013 is a deficient number, since it is larger than the sum of its proper divisors (262930387).
1967992013 is a wasteful number, since it uses less digits than its factorization.
1967992013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7967611.
The product of its (nonzero) digits is 183708, while the sum is 47.
The square root of 1967992013 is about 44362.0560051042. The cubic root of 1967992013 is about 1253.1636159127.
The spelling of 1967992013 in words is "one billion, nine hundred sixty-seven million, nine hundred ninety-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •