Base | Representation |
---|---|
bin | 111101100100010000… |
… | …0111100110111100001 |
3 | 110122021011021101002112 |
4 | 1323020200330313201 |
5 | 4131233023200001 |
6 | 140423213325105 |
7 | 12360235543643 |
oct | 1731040746741 |
9 | 418234241075 |
10 | 132213100001 |
11 | 510869369a4 |
12 | 21759a96795 |
13 | c610541a68 |
14 | 6583396893 |
15 | 368c2bbcbb |
hex | 1ec883cde1 |
132213100001 has 8 divisors (see below), whose sum is σ = 132422356224. Its totient is φ = 132004011040.
The previous prime is 132213099989. The next prime is 132213100003. The reversal of 132213100001 is 100001312231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132213100001 - 226 = 132145991137 is a prime.
It is a super-3 number, since 3×1322131000013 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132213100003) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1590296 + ... + 1671366.
It is an arithmetic number, because the mean of its divisors is an integer number (16552794528).
Almost surely, 2132213100001 is an apocalyptic number.
It is an amenable number.
132213100001 is a deficient number, since it is larger than the sum of its proper divisors (209256223).
132213100001 is a wasteful number, since it uses less digits than its factorization.
132213100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83631.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 132213100001 its reverse (100001312231), we get a palindrome (232214412232).
The spelling of 132213100001 in words is "one hundred thirty-two billion, two hundred thirteen million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •