Base | Representation |
---|---|
bin | 100100011001001100011011… |
… | …0110000100001100111010011 |
3 | 1112222110100212100212201011120 |
4 | 1020302120312300201213103 |
5 | 313424334334322132243 |
6 | 3052502004404213323 |
7 | 124300023601144053 |
oct | 11062306660414723 |
9 | 1488410770781146 |
10 | 320122011130323 |
11 | 93000a897a0656 |
12 | 2baa195999a243 |
13 | 109814b744644c |
14 | 5909db9151563 |
15 | 270219500ac83 |
hex | 1232636c219d3 |
320122011130323 has 8 divisors (see below), whose sum is σ = 426849501681600. Its totient is φ = 213404597332968.
The previous prime is 320122011130303. The next prime is 320122011130373. The reversal of 320122011130323 is 323031110221023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320122011130323 - 232 = 320117716163027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 320122011130293 and 320122011130302.
It is not an unprimeable number, because it can be changed into a prime (320122011130303) 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, 2519114353 + ... + 2519241426.
It is an arithmetic number, because the mean of its divisors is an integer number (53356187710200).
Almost surely, 2320122011130323 is an apocalyptic number.
320122011130323 is a deficient number, since it is larger than the sum of its proper divisors (106727490551277).
320122011130323 is a wasteful number, since it uses less digits than its factorization.
320122011130323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5038376961.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 320122011130323 its reverse (323031110221023), we get a palindrome (643153121351346).
The spelling of 320122011130323 in words is "three hundred twenty trillion, one hundred twenty-two billion, eleven million, one hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •