Base | Representation |
---|---|
bin | 111111110111010… |
… | …010111101110100 |
3 | 2202200010211002120 |
4 | 333313102331310 |
5 | 4143243211322 |
6 | 254153035540 |
7 | 35360155464 |
oct | 7767227564 |
9 | 2680124076 |
10 | 1071460212 |
11 | 4aa8a1a09 |
12 | 25a9b5bb0 |
13 | 140c9a534 |
14 | a242dba4 |
15 | 640e9a5c |
hex | 3fdd2f74 |
1071460212 has 12 divisors (see below), whose sum is σ = 2500073856. Its totient is φ = 357153400.
The previous prime is 1071460211. The next prime is 1071460259. The reversal of 1071460212 is 2120641701.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×10714602122 = 2296053971798169888, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1071460211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44644164 + ... + 44644187.
It is an arithmetic number, because the mean of its divisors is an integer number (208339488).
Almost surely, 21071460212 is an apocalyptic number.
1071460212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1071460212 is an abundant number, since it is smaller than the sum of its proper divisors (1428613644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1071460212 is a wasteful number, since it uses less digits than its factorization.
1071460212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89288358 (or 89288356 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 24.
The square root of 1071460212 is about 32733.1668495427. The cubic root of 1071460212 is about 1023.2741807337.
The spelling of 1071460212 in words is "one billion, seventy-one million, four hundred sixty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •