Base | Representation |
---|---|
bin | 100100011010101101110011… |
… | …0001100111110001001011010 |
3 | 1120000012100121000222211002002 |
4 | 1020311123212030332021122 |
5 | 313441301104413431414 |
6 | 3053142025355441002 |
7 | 124321105413026315 |
oct | 11065334614761132 |
9 | 1500170530884062 |
10 | 320331113030234 |
11 | 93081731321989 |
12 | 2bb16395756162 |
13 | 1099812c3730c7 |
14 | 5916173db197c |
15 | 27078325894de |
hex | 12356e633e25a |
320331113030234 has 8 divisors (see below), whose sum is σ = 480499018639200. Its totient is φ = 160164773483836.
The previous prime is 320331113030209. The next prime is 320331113030239. The reversal of 320331113030234 is 432030311133023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×3203311130302342 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 320331113030197 and 320331113030206.
It is not an unprimeable number, because it can be changed into a prime (320331113030239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 391004144 + ... + 391822539.
It is an arithmetic number, because the mean of its divisors is an integer number (60062377329900).
Almost surely, 2320331113030234 is an apocalyptic number.
320331113030234 is a deficient number, since it is larger than the sum of its proper divisors (160167905608966).
320331113030234 is a wasteful number, since it uses less digits than its factorization.
320331113030234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 783031284.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 320331113030234 its reverse (432030311133023), we get a palindrome (752361424163257).
The spelling of 320331113030234 in words is "three hundred twenty trillion, three hundred thirty-one billion, one hundred thirteen million, thirty thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •