Base | Representation |
---|---|
bin | 101110101111101000000… |
… | …101011111000011001001 |
3 | 102101002100010120220211001 |
4 | 232233220011133003021 |
5 | 410112123441301441 |
6 | 10455402521335001 |
7 | 451035106141516 |
oct | 56575005370311 |
9 | 12332303526731 |
10 | 3212234322121 |
11 | 10293345941a0 |
12 | 43a676937461 |
13 | 1a3bb26c7226 |
14 | b1689b9030d |
15 | 58856cc2731 |
hex | 2ebe815f0c9 |
3212234322121 has 8 divisors (see below), whose sum is σ = 3570373655424. Its totient is φ = 2865114660720.
The previous prime is 3212234322109. The next prime is 3212234322181. The reversal of 3212234322121 is 1212234322123.
It is a happy number.
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 3212234322121 - 233 = 3203644387529 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3212234322121.
It is not an unprimeable number, because it can be changed into a prime (3212234322181) 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, 2754917361 + ... + 2754918526.
It is an arithmetic number, because the mean of its divisors is an integer number (446296706928).
Almost surely, 23212234322121 is an apocalyptic number.
It is an amenable number.
3212234322121 is a deficient number, since it is larger than the sum of its proper divisors (358139333303).
3212234322121 is a wasteful number, since it uses less digits than its factorization.
3212234322121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5509835951.
The product of its digits is 6912, while the sum is 28.
Adding to 3212234322121 its reverse (1212234322123), we get a palindrome (4424468644244).
The spelling of 3212234322121 in words is "three trillion, two hundred twelve billion, two hundred thirty-four million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •