Base | Representation |
---|---|
bin | 110000000011100011011010… |
… | …010000101010000010001100 |
3 | 1000201022220100122020011102111 |
4 | 300003203122100222002030 |
5 | 210200231121100014012 |
6 | 2025301012241033404 |
7 | 62342364150565462 |
oct | 6003433220520214 |
9 | 1021286318204374 |
10 | 211350412501132 |
11 | 6138522aa65833 |
12 | 1b855161625864 |
13 | 90c134887bc58 |
14 | 3a295b3728832 |
15 | 1967a98aceba7 |
hex | c038da42a08c |
211350412501132 has 48 divisors (see below), whose sum is σ = 382007933798400. Its totient is φ = 102209111913600.
The previous prime is 211350412501127. The next prime is 211350412501153. The reversal of 211350412501132 is 231105214053112.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 211350412501094 and 211350412501103.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4078759288 + ... + 4078811104.
It is an arithmetic number, because the mean of its divisors is an integer number (7958498620800).
Almost surely, 2211350412501132 is an apocalyptic number.
It is an amenable number.
211350412501132 is a deficient number, since it is larger than the sum of its proper divisors (170657521297268).
211350412501132 is a wasteful number, since it uses less digits than its factorization.
211350412501132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69622 (or 69620 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 211350412501132 its reverse (231105214053112), we get a palindrome (442455626554244).
The spelling of 211350412501132 in words is "two hundred eleven trillion, three hundred fifty billion, four hundred twelve million, five hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •