Base | Representation |
---|---|
bin | 111101100000111001… |
… | …0010001101000111110 |
3 | 110121222021211111210212 |
4 | 1323001302101220332 |
5 | 4131020122413042 |
6 | 140404101432422 |
7 | 12354365116256 |
oct | 1730162215076 |
9 | 417867744725 |
10 | 132100201022 |
11 | 51029135259 |
12 | 2172810b712 |
13 | c5c303302a |
14 | 65723a8966 |
15 | 368241a482 |
hex | 1ec1c91a3e |
132100201022 has 8 divisors (see below), whose sum is σ = 201508781400. Its totient is φ = 64930607224.
The previous prime is 132100201007. The next prime is 132100201033. The reversal of 132100201022 is 220102001231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1321002010222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132100200988 and 132100201006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 559746497 + ... + 559746732.
It is an arithmetic number, because the mean of its divisors is an integer number (25188597675).
Almost surely, 2132100201022 is an apocalyptic number.
132100201022 is a deficient number, since it is larger than the sum of its proper divisors (69408580378).
132100201022 is a wasteful number, since it uses less digits than its factorization.
132100201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1119493290.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 132100201022 its reverse (220102001231), we get a palindrome (352202202253).
The spelling of 132100201022 in words is "one hundred thirty-two billion, one hundred million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •