Base | Representation |
---|---|
bin | 1100010011001110111… |
… | …0011100110110100010 |
3 | 202012110100010212012111 |
4 | 3010303232130312202 |
5 | 11430241212243242 |
6 | 241025110545534 |
7 | 21160510444633 |
oct | 3046356346642 |
9 | 665410125174 |
10 | 211321212322 |
11 | 81691351620 |
12 | 34b570682aa |
13 | 16c0996078c |
14 | a3298c788a |
15 | 576c312817 |
hex | 3133b9cda2 |
211321212322 has 8 divisors (see below), whose sum is σ = 345798347472. Its totient is φ = 96055096500.
The previous prime is 211321212301. The next prime is 211321212341. The reversal of 211321212322 is 223212123112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 9605509651 = 211321212322 / (2 + 1 + 1 + 3 + 2 + 1 + 2 + 1 + 2 + 3 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 211321212293 and 211321212302.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4802754804 + ... + 4802754847.
It is an arithmetic number, because the mean of its divisors is an integer number (43224793434).
Almost surely, 2211321212322 is an apocalyptic number.
211321212322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
211321212322 is a deficient number, since it is larger than the sum of its proper divisors (134477135150).
211321212322 is a wasteful number, since it uses less digits than its factorization.
211321212322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9605509664.
The product of its digits is 576, while the sum is 22.
Adding to 211321212322 its reverse (223212123112), we get a palindrome (434533335434).
The spelling of 211321212322 in words is "two hundred eleven billion, three hundred twenty-one million, two hundred twelve thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •