Base | Representation |
---|---|
bin | 1001010100000101101… |
… | …10111010011100000001 |
3 | 1010121000221202111001200 |
4 | 10222002312322130001 |
5 | 20220401342404441 |
6 | 403003323451413 |
7 | 32056316505030 |
oct | 4520266723401 |
9 | 1117027674050 |
10 | 320023013121 |
11 | 1137a2714429 |
12 | 52033086b69 |
13 | 24241203276 |
14 | 116bc4d8717 |
15 | 84d04737b6 |
hex | 4a82dba701 |
320023013121 has 24 divisors (see below), whose sum is σ = 528349773120. Its totient is φ = 182850280416.
The previous prime is 320023013117. The next prime is 320023013129. The reversal of 320023013121 is 121310320023.
320023013121 is a `hidden beast` number, since 320 + 0 + 2 + 30 + 1 + 312 + 1 = 666.
It is not a de Polignac number, because 320023013121 - 22 = 320023013117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 320023013094 and 320023013103.
It is not an unprimeable number, because it can be changed into a prime (320023013129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 312150 + ... + 858768.
It is an arithmetic number, because the mean of its divisors is an integer number (22014573880).
Almost surely, 2320023013121 is an apocalyptic number.
It is an amenable number.
320023013121 is a deficient number, since it is larger than the sum of its proper divisors (208326759999).
320023013121 is a wasteful number, since it uses less digits than its factorization.
320023013121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555925 (or 555922 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 320023013121 its reverse (121310320023), we get a palindrome (441333333144).
The spelling of 320023013121 in words is "three hundred twenty billion, twenty-three million, thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •