Base | Representation |
---|---|
bin | 1001010110010011011… |
… | …11011000101000111011 |
3 | 1010201002211110112222101 |
4 | 10223021233120220323 |
5 | 20230320312101021 |
6 | 403321324404231 |
7 | 32130636560242 |
oct | 4531157305073 |
9 | 1121084415871 |
10 | 321212222011 |
11 | 114252a1a69a |
12 | 523053a6677 |
13 | 243a06b9a75 |
14 | 11792419959 |
15 | 854ea7ba91 |
hex | 4ac9bd8a3b |
321212222011 has 8 divisors (see below), whose sum is σ = 331958145024. Its totient is φ = 310490313960.
The previous prime is 321212221997. The next prime is 321212222063. The reversal of 321212222011 is 110222212123.
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-321212222011 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 321212222011.
It is not an unprimeable number, because it can be changed into a prime (321212222711) 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, 5976541 + ... + 6030046.
It is an arithmetic number, because the mean of its divisors is an integer number (41494768128).
Almost surely, 2321212222011 is an apocalyptic number.
321212222011 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
321212222011 is a deficient number, since it is larger than the sum of its proper divisors (10745923013).
321212222011 is a wasteful number, since it uses less digits than its factorization.
321212222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12007481.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 321212222011 its reverse (110222212123), we get a palindrome (431434434134).
The spelling of 321212222011 in words is "three hundred twenty-one billion, two hundred twelve million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •