Base | Representation |
---|---|
bin | 1100010111101010101… |
… | …0110100000101110110 |
3 | 202022112021202202101010 |
4 | 3011322222310011312 |
5 | 11440210412110040 |
6 | 241343145413050 |
7 | 21232142306112 |
oct | 3057252640566 |
9 | 668467682333 |
10 | 212511441270 |
11 | 82142194207 |
12 | 3522979a186 |
13 | 1706941366b |
14 | a3dd9d2742 |
15 | 57dba6ce80 |
hex | 317aab4176 |
212511441270 has 16 divisors (see below), whose sum is σ = 510027459120. Its totient is φ = 56669717664.
The previous prime is 212511441253. The next prime is 212511441271. The reversal of 212511441270 is 72144115212.
It is a super-2 number, since 2×2125114412702 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 7083714709 = 212511441270 / (2 + 1 + 2 + 5 + 1 + 1 + 4 + 4 + 1 + 2 + 7 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212511441271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3541857325 + ... + 3541857384.
It is an arithmetic number, because the mean of its divisors is an integer number (31876716195).
Almost surely, 2212511441270 is an apocalyptic number.
212511441270 is an abundant number, since it is smaller than the sum of its proper divisors (297516017850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212511441270 is a wasteful number, since it uses less digits than its factorization.
212511441270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7083714719.
The product of its (nonzero) digits is 4480, while the sum is 30.
Adding to 212511441270 its reverse (72144115212), we get a palindrome (284655556482).
The spelling of 212511441270 in words is "two hundred twelve billion, five hundred eleven million, four hundred forty-one thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •