Base | Representation |
---|---|
bin | 1001010100101001101… |
… | …11010111010111111011 |
3 | 1010121211000020011220001 |
4 | 10222110313113113323 |
5 | 20222011212342111 |
6 | 403053315013431 |
7 | 32066645415412 |
oct | 4522467272773 |
9 | 1117730204801 |
10 | 320325121531 |
11 | 1139381a89a8 |
12 | 520b829a277 |
13 | 2428b98b93c |
14 | 1170a69a479 |
15 | 84ebc4c1c1 |
hex | 4a94dd75fb |
320325121531 has 8 divisors (see below), whose sum is σ = 334260658944. Its totient is φ = 306390280680.
The previous prime is 320325121517. The next prime is 320325121559. The reversal of 320325121531 is 135121523023.
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 320325121531 - 227 = 320190903803 is a prime.
It is a super-2 number, since 2×3203251215312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 320325121531.
It is not an unprimeable number, because it can be changed into a prime (320325121031) 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, 909010 + ... + 1211176.
It is an arithmetic number, because the mean of its divisors is an integer number (41782582368).
Almost surely, 2320325121531 is an apocalyptic number.
320325121531 is a deficient number, since it is larger than the sum of its proper divisors (13935537413).
320325121531 is a wasteful number, since it uses less digits than its factorization.
320325121531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 348281.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 320325121531 its reverse (135121523023), we get a palindrome (455446644554).
The spelling of 320325121531 in words is "three hundred twenty billion, three hundred twenty-five million, one hundred twenty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •