Base | Representation |
---|---|
bin | 1001010110011110011… |
… | …10101101100010010001 |
3 | 1010201100020202121212101 |
4 | 10223033032231202101 |
5 | 20231012401221040 |
6 | 403334414400401 |
7 | 32133135442024 |
oct | 4531716554221 |
9 | 1121306677771 |
10 | 321304320145 |
11 | 11429aa04356 |
12 | 52330200101 |
13 | 243b67c49c3 |
14 | 117a07511bb |
15 | 8557bc009a |
hex | 4acf3ad891 |
321304320145 has 8 divisors (see below), whose sum is σ = 385640623656. Its totient is φ = 256993163136.
The previous prime is 321304320131. The next prime is 321304320163. The reversal of 321304320145 is 541023403123.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 26272843921 + 295031476224 = 162089^2 + 543168^2 .
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 321304320145 - 215 = 321304287377 is a prime.
It is a super-2 number, since 2×3213043201452 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6258502 + ... + 6309631.
It is an arithmetic number, because the mean of its divisors is an integer number (48205077957).
Almost surely, 2321304320145 is an apocalyptic number.
It is an amenable number.
321304320145 is a deficient number, since it is larger than the sum of its proper divisors (64336303511).
321304320145 is a wasteful number, since it uses less digits than its factorization.
321304320145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12573251.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 321304320145 its reverse (541023403123), we get a palindrome (862327723268).
The spelling of 321304320145 in words is "three hundred twenty-one billion, three hundred four million, three hundred twenty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •