Base | Representation |
---|---|
bin | 1001010110010011011… |
… | …11000010101100000111 |
3 | 1010201002211021222122110 |
4 | 10223021233002230013 |
5 | 20230320301211403 |
6 | 403321322432103 |
7 | 32130636034152 |
oct | 4531157025407 |
9 | 1121084258573 |
10 | 321212132103 |
11 | 114252969095 |
12 | 52305362633 |
13 | 243a0687b75 |
14 | 117923d4c99 |
15 | 854ea60103 |
hex | 4ac9bc2b07 |
321212132103 has 4 divisors (see below), whose sum is σ = 428282842808. Its totient is φ = 214141421400.
The previous prime is 321212132099. The next prime is 321212132141. The reversal of 321212132103 is 301231212123.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 321212132103 - 22 = 321212132099 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 321212132103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321212132503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53535355348 + ... + 53535355353.
It is an arithmetic number, because the mean of its divisors is an integer number (107070710702).
Almost surely, 2321212132103 is an apocalyptic number.
321212132103 is a deficient number, since it is larger than the sum of its proper divisors (107070710705).
321212132103 is a wasteful number, since it uses less digits than its factorization.
321212132103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107070710704.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 321212132103 its reverse (301231212123), we get a palindrome (622443344226).
The spelling of 321212132103 in words is "three hundred twenty-one billion, two hundred twelve million, one hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •