Base | Representation |
---|---|
bin | 1001010110011111011… |
… | …01001110111000001001 |
3 | 1010201100210211010000120 |
4 | 10223033231032320021 |
5 | 20231021423233113 |
6 | 403335302053453 |
7 | 32133263444154 |
oct | 4531755167011 |
9 | 1121323733016 |
10 | 321312321033 |
11 | 1142a4479560 |
12 | 52332a1a289 |
13 | 243b8366662 |
14 | 117a1834c9b |
15 | 8558750a23 |
hex | 4acfb4ee09 |
321312321033 has 32 divisors (see below), whose sum is σ = 471721536000. Its totient is φ = 192924562560.
The previous prime is 321312321013. The next prime is 321312321041. The reversal of 321312321033 is 330123213123.
It is not a de Polignac number, because 321312321033 - 212 = 321312316937 is a prime.
It is a super-2 number, since 2×3213123210332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 321312320994 and 321312321012.
It is not an unprimeable number, because it can be changed into a prime (321312321013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2184766 + ... + 2327192.
It is an arithmetic number, because the mean of its divisors is an integer number (14741298000).
Almost surely, 2321312321033 is an apocalyptic number.
321312321033 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
321312321033 is a deficient number, since it is larger than the sum of its proper divisors (150409214967).
321312321033 is a wasteful number, since it uses less digits than its factorization.
321312321033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143077.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 321312321033 its reverse (330123213123), we get a palindrome (651435534156).
The spelling of 321312321033 in words is "three hundred twenty-one billion, three hundred twelve million, three hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •