Base | Representation |
---|---|
bin | 1110100110010001001110… |
… | …01000100010100000001001 |
3 | 11012122211220202110012021210 |
4 | 13103020213020202200021 |
5 | 13201421320440321301 |
6 | 152135035042123333 |
7 | 6522144463616412 |
oct | 723104710424011 |
9 | 135584822405253 |
10 | 32101242120201 |
11 | a257073332261 |
12 | 3725529050549 |
13 | 14bb198934107 |
14 | 7cd9cbc32809 |
15 | 3aa06109bad6 |
hex | 1d3227222809 |
32101242120201 has 8 divisors (see below), whose sum is σ = 42801695289280. Its totient is φ = 21400808515632.
The previous prime is 32101242120139. The next prime is 32101242120223. The reversal of 32101242120201 is 10202124210123.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32101242120201 - 218 = 32101241858057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32101242120251) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 499246 + ... + 8028183.
It is an arithmetic number, because the mean of its divisors is an integer number (5350211911160).
Almost surely, 232101242120201 is an apocalyptic number.
It is an amenable number.
32101242120201 is a deficient number, since it is larger than the sum of its proper divisors (10700453169079).
32101242120201 is a wasteful number, since it uses less digits than its factorization.
32101242120201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9782255.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 32101242120201 its reverse (10202124210123), we get a palindrome (42303366330324).
The spelling of 32101242120201 in words is "thirty-two trillion, one hundred one billion, two hundred forty-two million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •