Base | Representation |
---|---|
bin | 101111111111111010100000… |
… | …001111110111101010101100 |
3 | 1000200102222212000222100221212 |
4 | 233333322200033313222230 |
5 | 210132131434231110012 |
6 | 2024550053041013552 |
7 | 62315331666062066 |
oct | 5777724017675254 |
9 | 1020388760870855 |
10 | 211100331113132 |
11 | 612991695a257a |
12 | 1b8147a99242b8 |
13 | 90a38a2994ca6 |
14 | 3a1b44c1ac736 |
15 | 196130da8ab22 |
hex | bffea03f7aac |
211100331113132 has 12 divisors (see below), whose sum is σ = 369443047352400. Its totient is φ = 105545174726736.
The previous prime is 211100331113131. The next prime is 211100331113183. The reversal of 211100331113132 is 231311133001112.
It is a junction number, because it is equal to n+sod(n) for n = 211100331113098 and 211100331113107.
It is not an unprimeable number, because it can be changed into a prime (211100331113131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1247612288 + ... + 1247781479.
It is an arithmetic number, because the mean of its divisors is an integer number (30786920612700).
Almost surely, 2211100331113132 is an apocalyptic number.
It is an amenable number.
211100331113132 is a deficient number, since it is larger than the sum of its proper divisors (158342716239268).
211100331113132 is a wasteful number, since it uses less digits than its factorization.
211100331113132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2495414920 (or 2495414918 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 211100331113132 its reverse (231311133001112), we get a palindrome (442411464114244).
The spelling of 211100331113132 in words is "two hundred eleven trillion, one hundred billion, three hundred thirty-one million, one hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •