Base | Representation |
---|---|
bin | 1100010110110000001… |
… | …0000010010010111000 |
3 | 202021220011200110122011 |
4 | 3011230002002102320 |
5 | 11434210030324040 |
6 | 241302534135304 |
7 | 21223101062314 |
oct | 3055402022270 |
9 | 667804613564 |
10 | 212265870520 |
11 | 82026606280 |
12 | 3517b4b1534 |
13 | 1702a592022 |
14 | a3b914ab44 |
15 | 57c52113ea |
hex | 316c0824b8 |
212265870520 has 64 divisors (see below), whose sum is σ = 521066649600. Its totient is φ = 77180119680.
The previous prime is 212265870497. The next prime is 212265870569. The reversal of 212265870520 is 25078562212.
212265870520 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2122658705202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6777537 + ... + 6808783.
It is an arithmetic number, because the mean of its divisors is an integer number (8141666400).
Almost surely, 2212265870520 is an apocalyptic number.
212265870520 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212265870520 is an abundant number, since it is smaller than the sum of its proper divisors (308800779080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212265870520 is a wasteful number, since it uses less digits than its factorization.
212265870520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46708 (or 46704 counting only the distinct ones).
The product of its (nonzero) digits is 134400, while the sum is 40.
The spelling of 212265870520 in words is "two hundred twelve billion, two hundred sixty-five million, eight hundred seventy thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •