Base | Representation |
---|---|
bin | 1001010110111001011… |
… | …00000010100001111001 |
3 | 1010201220222122001020011 |
4 | 10223130230002201321 |
5 | 20231443202041441 |
6 | 403413042101521 |
7 | 32141546600461 |
oct | 4533454024171 |
9 | 1121828561204 |
10 | 321530112121 |
11 | 1143a6403199 |
12 | 5239394a8a1 |
13 | 2442150c81a |
14 | 117c2728ba1 |
15 | 856c921581 |
hex | 4adcb02879 |
321530112121 has 8 divisors (see below), whose sum is σ = 325290332160. Its totient is φ = 317773170528.
The previous prime is 321530112109. The next prime is 321530112143. The reversal of 321530112121 is 121211035123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 321530112121 - 213 = 321530103929 is a prime.
It is a super-2 number, since 2×3215301121212 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 321530112092 and 321530112101.
It is not an unprimeable number, because it can be changed into a prime (321530112181) 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, 622041 + ... + 1014886.
It is an arithmetic number, because the mean of its divisors is an integer number (40661291520).
Almost surely, 2321530112121 is an apocalyptic number.
It is an amenable number.
321530112121 is a deficient number, since it is larger than the sum of its proper divisors (3760220039).
321530112121 is a wasteful number, since it uses less digits than its factorization.
321530112121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1639223.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 321530112121 its reverse (121211035123), we get a palindrome (442741147244).
The spelling of 321530112121 in words is "three hundred twenty-one billion, five hundred thirty million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •