Base | Representation |
---|---|
bin | 100011100111000111111100… |
… | …0101100010111001001111001 |
3 | 1112002002111022022010120111101 |
4 | 1013032033320230113021321 |
5 | 312024112401123241241 |
6 | 3030112400142131401 |
7 | 122656605630552052 |
oct | 10716177054271171 |
9 | 1462074268116441 |
10 | 313240432243321 |
11 | 90898580927240 |
12 | 2b170116b80b61 |
13 | 105a25a4b8231b |
14 | 574ccbc6a5729 |
15 | 2633180d83e31 |
hex | 11ce3f8b17279 |
313240432243321 has 8 divisors (see below), whose sum is σ = 341940033648288. Its totient is φ = 284578030584000.
The previous prime is 313240432243301. The next prime is 313240432243331. The reversal of 313240432243321 is 123342234042313.
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 313240432243321 - 233 = 313231842308729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313240432243301) 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, 9299918800 + ... + 9299952481.
It is an arithmetic number, because the mean of its divisors is an integer number (42742504206036).
Almost surely, 2313240432243321 is an apocalyptic number.
It is an amenable number.
313240432243321 is a deficient number, since it is larger than the sum of its proper divisors (28699601404967).
313240432243321 is a wasteful number, since it uses less digits than its factorization.
313240432243321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18599872823.
The product of its (nonzero) digits is 248832, while the sum is 37.
Adding to 313240432243321 its reverse (123342234042313), we get a palindrome (436582666285634).
The spelling of 313240432243321 in words is "three hundred thirteen trillion, two hundred forty billion, four hundred thirty-two million, two hundred forty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •