Base | Representation |
---|---|
bin | 1001010110100010101… |
… | …10111100110001011101 |
3 | 1010201102201222002020222 |
4 | 10223101112330301131 |
5 | 20231101022043031 |
6 | 403342132051125 |
7 | 32134051136330 |
oct | 4532126746135 |
9 | 1121381862228 |
10 | 321340034141 |
11 | 114309087855 |
12 | 52340163aa5 |
13 | 243c101a749 |
14 | 117a53aa617 |
15 | 855adc6e7b |
hex | 4ad15bcc5d |
321340034141 has 8 divisors (see below), whose sum is σ = 375059493120. Its totient is φ = 269574010128.
The previous prime is 321340034101. The next prime is 321340034149. The reversal of 321340034141 is 141430043123.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 321340034141 - 226 = 321272925277 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 321340034141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321340034149) 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, 488358386 + ... + 488359043.
It is an arithmetic number, because the mean of its divisors is an integer number (46882436640).
Almost surely, 2321340034141 is an apocalyptic number.
It is an amenable number.
321340034141 is a deficient number, since it is larger than the sum of its proper divisors (53719458979).
321340034141 is an equidigital number, since it uses as much as digits as its factorization.
321340034141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 976717483.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 321340034141 its reverse (141430043123), we get a palindrome (462770077264).
The spelling of 321340034141 in words is "three hundred twenty-one billion, three hundred forty million, thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •