Base | Representation |
---|---|
bin | 1001010110001001101… |
… | …10000111100100011101 |
3 | 1010200220002221101011020 |
4 | 10223010312013210131 |
5 | 20230133301213041 |
6 | 403305232314353 |
7 | 32125621551402 |
oct | 4530466074435 |
9 | 1120802841136 |
10 | 321130101021 |
11 | 11421062aa04 |
12 | 522a19a29b9 |
13 | 24389696172 |
14 | 117855602a9 |
15 | 8547759866 |
hex | 4ac4d8791d |
321130101021 has 4 divisors (see below), whose sum is σ = 428173468032. Its totient is φ = 214086734012.
The previous prime is 321130100981. The next prime is 321130101023. The reversal of 321130101021 is 120101031123.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 321130101021 - 26 = 321130100957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321130101023) 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, 53521683501 + ... + 53521683506.
It is an arithmetic number, because the mean of its divisors is an integer number (107043367008).
Almost surely, 2321130101021 is an apocalyptic number.
It is an amenable number.
321130101021 is a deficient number, since it is larger than the sum of its proper divisors (107043367011).
321130101021 is a wasteful number, since it uses less digits than its factorization.
321130101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107043367010.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 321130101021 its reverse (120101031123), we get a palindrome (441231132144).
The spelling of 321130101021 in words is "three hundred twenty-one billion, one hundred thirty million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •