Base | Representation |
---|---|
bin | 1110101001100001011000… |
… | …11111010010110011101001 |
3 | 11020001112101102201200010122 |
4 | 13110300230133102303221 |
5 | 13210234211241333001 |
6 | 152302240505253025 |
7 | 6533212124505161 |
oct | 724605437226351 |
9 | 136045342650118 |
10 | 32213001121001 |
11 | a29a503383738 |
12 | 3743118a94175 |
13 | 14c889969779c |
14 | 7d51908995a1 |
15 | 3ace027eeb1b |
hex | 1d4c2c7d2ce9 |
32213001121001 has 8 divisors (see below), whose sum is σ = 32524246851264. Its totient is φ = 31901944088080.
The previous prime is 32213001120961. The next prime is 32213001121073. The reversal of 32213001121001 is 10012110031223.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32213001121001 is a prime.
It is a super-2 number, since 2×322130011210012 (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 (32213001121201) 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, 46831250 + ... + 47514123.
It is an arithmetic number, because the mean of its divisors is an integer number (4065530856408).
Almost surely, 232213001121001 is an apocalyptic number.
It is an amenable number.
32213001121001 is a deficient number, since it is larger than the sum of its proper divisors (311245730263).
32213001121001 is a wasteful number, since it uses less digits than its factorization.
32213001121001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94348671.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 32213001121001 its reverse (10012110031223), we get a palindrome (42225111152224).
The spelling of 32213001121001 in words is "thirty-two trillion, two hundred thirteen billion, one million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •