Base | Representation |
---|---|
bin | 10000001101100… |
… | …10001001101100 |
3 | 100110220022110100 |
4 | 20012302021230 |
5 | 234303333022 |
6 | 21254511100 |
7 | 3240642555 |
oct | 1006621154 |
9 | 313808410 |
10 | 135996012 |
11 | 6a8478a9 |
12 | 39665490 |
13 | 22237a19 |
14 | 140c132c |
15 | be151ac |
hex | 81b226c |
135996012 has 18 divisors (see below), whose sum is σ = 343767788. Its totient is φ = 45331992.
The previous prime is 135995983. The next prime is 135996031. The reversal of 135996012 is 210699531.
135996012 is a `hidden beast` number, since 1 + 3 + 599 + 60 + 1 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 3777667 = 135996012 / (1 + 3 + 5 + 9 + 9 + 6 + 0 + 1 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1888798 + ... + 1888869.
Almost surely, 2135996012 is an apocalyptic number.
135996012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
135996012 is an abundant number, since it is smaller than the sum of its proper divisors (207771776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135996012 is a wasteful number, since it uses less digits than its factorization.
135996012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3777677 (or 3777672 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 36.
The square root of 135996012 is about 11661.7328043477. The cubic root of 135996012 is about 514.2512914791.
The spelling of 135996012 in words is "one hundred thirty-five million, nine hundred ninety-six thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •