Base | Representation |
---|---|
bin | 1001011000000000111… |
… | …00111011100100010101 |
3 | 1010210110210200011200210 |
4 | 10230000130323210111 |
5 | 20234210303144341 |
6 | 403552354400033 |
7 | 32162453636343 |
oct | 4540034734425 |
9 | 1123423604623 |
10 | 322130131221 |
11 | 114684074448 |
12 | 52520890019 |
13 | 244b8914002 |
14 | 1183c2b8993 |
15 | 85a5444c16 |
hex | 4b0073b915 |
322130131221 has 4 divisors (see below), whose sum is σ = 429506841632. Its totient is φ = 214753420812.
The previous prime is 322130131201. The next prime is 322130131223. The reversal of 322130131221 is 122131031223.
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 not a de Polignac number, because 322130131221 - 27 = 322130131093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (322130131223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53688355201 + ... + 53688355206.
It is an arithmetic number, because the mean of its divisors is an integer number (107376710408).
Almost surely, 2322130131221 is an apocalyptic number.
It is an amenable number.
322130131221 is a deficient number, since it is larger than the sum of its proper divisors (107376710411).
322130131221 is a wasteful number, since it uses less digits than its factorization.
322130131221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107376710410.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 322130131221 its reverse (122131031223), we get a palindrome (444261162444).
The spelling of 322130131221 in words is "three hundred twenty-two billion, one hundred thirty million, one hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •