Base | Representation |
---|---|
bin | 1110100110110110000010… |
… | …11010001010010100101001 |
3 | 11012201201221102202210021121 |
4 | 13103123001122022110221 |
5 | 13202232312114101301 |
6 | 152152104410535241 |
7 | 6523444402440304 |
oct | 723330132122451 |
9 | 135651842683247 |
10 | 32121010300201 |
11 | a264497a154a9 |
12 | 3729325437521 |
13 | 14bccc9293244 |
14 | 7d0945411b3b |
15 | 3aa81b7c53a1 |
hex | 1d36c168a529 |
32121010300201 has 8 divisors (see below), whose sum is σ = 32727276987840. Its totient is φ = 31514751386352.
The previous prime is 32121010300163. The next prime is 32121010300219. The reversal of 32121010300201 is 10200301012123.
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 32121010300201 - 29 = 32121010299689 is a prime.
It is a super-2 number, since 2×321210103002012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32121010300241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6763116 + ... + 10487218.
It is an arithmetic number, because the mean of its divisors is an integer number (4090909623480).
Almost surely, 232121010300201 is an apocalyptic number.
It is an amenable number.
32121010300201 is a deficient number, since it is larger than the sum of its proper divisors (606266687639).
32121010300201 is a wasteful number, since it uses less digits than its factorization.
32121010300201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3886895.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 32121010300201 its reverse (10200301012123), we get a palindrome (42321311312324).
The spelling of 32121010300201 in words is "thirty-two trillion, one hundred twenty-one billion, ten million, three hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •