Base | Representation |
---|---|
bin | 10110001010110010… |
… | …10110001100110011 |
3 | 1010201110010112022100 |
4 | 23011121112030303 |
5 | 143333313100200 |
6 | 5244554311443 |
7 | 600635462430 |
oct | 130531261463 |
9 | 33643115270 |
10 | 11901690675 |
11 | 50582153a6 |
12 | 2381a28583 |
13 | 1178993724 |
14 | 80c94ab87 |
15 | 499d01d00 |
hex | 2c5656333 |
11901690675 has 36 divisors (see below), whose sum is σ = 24362575120. Its totient is φ = 5440772160.
The previous prime is 11901690643. The next prime is 11901690721. The reversal of 11901690675 is 57609610911.
11901690675 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11901690675 - 25 = 11901690643 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 11901690675.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 3776740 + ... + 3779889.
Almost surely, 211901690675 is an apocalyptic number.
11901690675 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11901690675 is an abundant number, since it is smaller than the sum of its proper divisors (12460884445).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11901690675 is a wasteful number, since it uses less digits than its factorization.
11901690675 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7556652 (or 7556644 counting only the distinct ones).
The product of its (nonzero) digits is 102060, while the sum is 45.
The spelling of 11901690675 in words is "eleven billion, nine hundred one million, six hundred ninety thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •