Base | Representation |
---|---|
bin | 1001010100010010110… |
… | …11110100101010111011 |
3 | 1010121022122101021201101 |
4 | 10222021123310222323 |
5 | 20221113114231443 |
6 | 403022304432231 |
7 | 32062126411054 |
oct | 4521133645273 |
9 | 1117278337641 |
10 | 320133352123 |
11 | 113849a27792 |
12 | 52064018677 |
13 | 2425b026a10 |
14 | 116cd01b72b |
15 | 84d9ebb84d |
hex | 4a896f4abb |
320133352123 has 4 divisors (see below), whose sum is σ = 344758994608. Its totient is φ = 295507709640.
The previous prime is 320133352087. The next prime is 320133352151. The reversal of 320133352123 is 321253331023.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 321253331023 = 283 ⋅1135170781.
It is not a de Polignac number, because 320133352123 - 237 = 182694398651 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320133352091 and 320133352100.
It is not an unprimeable number, because it can be changed into a prime (320133352153) 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, 12312821223 + ... + 12312821248.
It is an arithmetic number, because the mean of its divisors is an integer number (86189748652).
Almost surely, 2320133352123 is an apocalyptic number.
320133352123 is a deficient number, since it is larger than the sum of its proper divisors (24625642485).
320133352123 is a wasteful number, since it uses less digits than its factorization.
320133352123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24625642484.
The product of its (nonzero) digits is 9720, while the sum is 28.
Adding to 320133352123 its reverse (321253331023), we get a palindrome (641386683146).
The spelling of 320133352123 in words is "three hundred twenty billion, one hundred thirty-three million, three hundred fifty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •