Base | Representation |
---|---|
bin | 1001010100001111001… |
… | …00010110010000100101 |
3 | 1010121020110110002011102 |
4 | 10222013210112100211 |
5 | 20221032110014141 |
6 | 403015225245445 |
7 | 32061266245013 |
oct | 4520744262045 |
9 | 1117213402142 |
10 | 320102032421 |
11 | 113833285836 |
12 | 52055633885 |
13 | 242546ac152 |
14 | 116c8bc78b3 |
15 | 84d738199b |
hex | 4a87916425 |
320102032421 has 2 divisors, whose sum is σ = 320102032422. Its totient is φ = 320102032420.
The previous prime is 320102032409. The next prime is 320102032447. The reversal of 320102032421 is 124230201023.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 277402356100 + 42699676321 = 526690^2 + 206639^2 .
It is a cyclic number.
It is not a de Polignac number, because 320102032421 - 26 = 320102032357 is a prime.
It is a super-2 number, since 2×3201020324212 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 320102032393 and 320102032402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320102832421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160051016210 + 160051016211.
It is an arithmetic number, because the mean of its divisors is an integer number (160051016211).
Almost surely, 2320102032421 is an apocalyptic number.
It is an amenable number.
320102032421 is a deficient number, since it is larger than the sum of its proper divisors (1).
320102032421 is an equidigital number, since it uses as much as digits as its factorization.
320102032421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 320102032421 its reverse (124230201023), we get a palindrome (444332233444).
The spelling of 320102032421 in words is "three hundred twenty billion, one hundred two million, thirty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •