Base | Representation |
---|---|
bin | 100001001100100… |
… | …0001100011010100 |
3 | 2212121220202110210 |
4 | 1002121001203110 |
5 | 4240121344322 |
6 | 302305445420 |
7 | 36413423130 |
oct | 10231014324 |
9 | 2777822423 |
10 | 1113856212 |
11 | 521819727 |
12 | 271040870 |
13 | 1499c2821 |
14 | a7d083c0 |
15 | 67bc170c |
hex | 426418d4 |
1113856212 has 24 divisors (see below), whose sum is σ = 2970283456. Its totient is φ = 318244608.
The previous prime is 1113856199. The next prime is 1113856217. The reversal of 1113856212 is 2126583111.
It is a super-2 number, since 2×11138562122 = 2481351322021977888, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1113856212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113856217) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 6630013 + ... + 6630180.
Almost surely, 21113856212 is an apocalyptic number.
1113856212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1113856212 is an abundant number, since it is smaller than the sum of its proper divisors (1856427244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113856212 is a wasteful number, since it uses less digits than its factorization.
1113856212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13260207 (or 13260205 counting only the distinct ones).
The product of its digits is 2880, while the sum is 30.
The square root of 1113856212 is about 33374.4844454562. The cubic root of 1113856212 is about 1036.5964338414.
The spelling of 1113856212 in words is "one billion, one hundred thirteen million, eight hundred fifty-six thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •