Base | Representation |
---|---|
bin | 100100011010100110011010… |
… | …0000111000001100111000111 |
3 | 1120000010211121211111210000000 |
4 | 1020311030310013001213013 |
5 | 313441021102444201343 |
6 | 3053130442342252343 |
7 | 124320004154305005 |
oct | 11065146407014707 |
9 | 1500124554453000 |
10 | 320315240225223 |
11 | 93075a26562611 |
12 | 2bb132a5a270b3 |
13 | 1099679ca629a9 |
14 | 59154a9cada75 |
15 | 2707203d1aed3 |
hex | 12353341c19c7 |
320315240225223 has 32 divisors (see below), whose sum is σ = 480521911780800. Its totient is φ = 213489137160000.
The previous prime is 320315240225213. The next prime is 320315240225263. The reversal of 320315240225223 is 322522042513023.
320315240225223 is a `hidden beast` number, since 3 + 2 + 0 + 3 + 1 + 5 + 2 + 402 + 25 + 223 = 666.
It is not a de Polignac number, because 320315240225223 - 216 = 320315240159687 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320315240225213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10046028 + ... + 27231473.
It is an arithmetic number, because the mean of its divisors is an integer number (15016309743150).
Almost surely, 2320315240225223 is an apocalyptic number.
320315240225223 is a deficient number, since it is larger than the sum of its proper divisors (160206671555577).
320315240225223 is an frugal number, since it uses more digits than its factorization.
320315240225223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37281451 (or 37281433 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 36.
Adding to 320315240225223 its reverse (322522042513023), we get a palindrome (642837282738246).
The spelling of 320315240225223 in words is "three hundred twenty trillion, three hundred fifteen billion, two hundred forty million, two hundred twenty-five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •