Base | Representation |
---|---|
bin | 100100011000011110010101… |
… | …1001001000111011100010011 |
3 | 1112222002220101100012001000221 |
4 | 1020300330223021013130103 |
5 | 313421224132143033243 |
6 | 3052344315030053511 |
7 | 124256621031346546 |
oct | 11060745311073423 |
9 | 1488086340161027 |
10 | 320023032002323 |
11 | 92a73007644821 |
12 | 2ba86735aaa297 |
13 | 109750722a11a0 |
14 | 59052a991285d |
15 | 26ee800726bed |
hex | 1230f2b247713 |
320023032002323 has 8 divisors (see below), whose sum is σ = 344707778142000. Its totient is φ = 295347941552928.
The previous prime is 320023032002309. The next prime is 320023032002339. The reversal of 320023032002323 is 323200230320023.
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 320023032002323 - 29 = 320023032001811 is a prime.
It is not an unprimeable number, because it can be changed into a prime (320023032002423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2413853728 + ... + 2413986301.
It is an arithmetic number, because the mean of its divisors is an integer number (43088472267750).
Almost surely, 2320023032002323 is an apocalyptic number.
320023032002323 is a deficient number, since it is larger than the sum of its proper divisors (24684746139677).
320023032002323 is a wasteful number, since it uses less digits than its factorization.
320023032002323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4827845141.
The product of its (nonzero) digits is 7776, while the sum is 25.
Adding to 320023032002323 its reverse (323200230320023), we get a palindrome (643223262322346).
The spelling of 320023032002323 in words is "three hundred twenty trillion, twenty-three billion, thirty-two million, two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •