Base | Representation |
---|---|
bin | 100100011010110010100011… |
… | …0111011011100101001001101 |
3 | 1120000020022221210001022002110 |
4 | 1020311211012323130221031 |
5 | 313441433013343323401 |
6 | 3053150435022014233 |
7 | 124321616452561011 |
oct | 11065450673345115 |
9 | 1500208853038073 |
10 | 320341325761101 |
11 | 93085aa2124827 |
12 | 2bb18365a17379 |
13 | 10999099154418 |
14 | 59168624ac541 |
15 | 2707c2de689d6 |
hex | 1235946edca4d |
320341325761101 has 8 divisors (see below), whose sum is σ = 429590679634080. Its totient is φ = 212326427864432.
The previous prime is 320341325761099. The next prime is 320341325761229. The reversal of 320341325761101 is 101167523143023.
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 320341325761101 - 21 = 320341325761099 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 320341325761101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320341325761901) 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, 308613993471 + ... + 308613994508.
It is an arithmetic number, because the mean of its divisors is an integer number (53698834954260).
Almost surely, 2320341325761101 is an apocalyptic number.
It is an amenable number.
320341325761101 is a deficient number, since it is larger than the sum of its proper divisors (109249353872979).
320341325761101 is a wasteful number, since it uses less digits than its factorization.
320341325761101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617227988155.
The product of its (nonzero) digits is 90720, while the sum is 39.
The spelling of 320341325761101 in words is "three hundred twenty trillion, three hundred forty-one billion, three hundred twenty-five million, seven hundred sixty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •