Base | Representation |
---|---|
bin | 1001010110010111001… |
… | …00110111111100111001 |
3 | 1010201011222102022101212 |
4 | 10223023210313330321 |
5 | 20230401203133423 |
6 | 403324344452505 |
7 | 32131462424450 |
oct | 4531344677471 |
9 | 1121158368355 |
10 | 321243021113 |
11 | 1142693464a3 |
12 | 5231377a135 |
13 | 243a6bb16a1 |
14 | 11796555b97 |
15 | 8552612578 |
hex | 4acb937f39 |
321243021113 has 8 divisors (see below), whose sum is σ = 386457769920. Its totient is φ = 260858994480.
The previous prime is 321243021091. The next prime is 321243021137. The reversal of 321243021113 is 311120342123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 321243021113 - 234 = 304063151929 is a prime.
It is a super-2 number, since 2×3212430211132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (321243029113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1207680398 + ... + 1207680663.
It is an arithmetic number, because the mean of its divisors is an integer number (48307221240).
Almost surely, 2321243021113 is an apocalyptic number.
It is an amenable number.
321243021113 is a deficient number, since it is larger than the sum of its proper divisors (65214748807).
321243021113 is a wasteful number, since it uses less digits than its factorization.
321243021113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2415361087.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 321243021113 its reverse (311120342123), we get a palindrome (632363363236).
The spelling of 321243021113 in words is "three hundred twenty-one billion, two hundred forty-three million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •