Base | Representation |
---|---|
bin | 100100100000011110000110… |
… | …0100010010001111100001001 |
3 | 1120002222222002102001120102111 |
4 | 1021000330030202101330021 |
5 | 314042230404203224001 |
6 | 3054545231334102321 |
7 | 124432205156336356 |
oct | 11100741442217411 |
9 | 1502888072046374 |
10 | 321122030133001 |
11 | 933570a7415539 |
12 | 300237261aa9a1 |
13 | 10a248a6636476 |
14 | 5942563d0362d |
15 | 271d1c3277851 |
hex | 1240f0c891f09 |
321122030133001 has 16 divisors (see below), whose sum is σ = 340060582672128. Its totient is φ = 302604754636800.
The previous prime is 321122030132993. The next prime is 321122030133029. The reversal of 321122030133001 is 100331030221123.
It is a cyclic number.
It is not a de Polignac number, because 321122030133001 - 23 = 321122030132993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (321122030133601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72273336 + ... + 76587721.
It is an arithmetic number, because the mean of its divisors is an integer number (21253786417008).
Almost surely, 2321122030133001 is an apocalyptic number.
It is an amenable number.
321122030133001 is a deficient number, since it is larger than the sum of its proper divisors (18938552539127).
321122030133001 is a wasteful number, since it uses less digits than its factorization.
321122030133001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148862472.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 321122030133001 its reverse (100331030221123), we get a palindrome (421453060354124).
The spelling of 321122030133001 in words is "three hundred twenty-one trillion, one hundred twenty-two billion, thirty million, one hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •