Base | Representation |
---|---|
bin | 101101011011100111100… |
… | …100010110001110010001 |
3 | 102001110111201201201212202 |
4 | 231123213210112032101 |
5 | 402122410004301001 |
6 | 10350124050132545 |
7 | 441362563244054 |
oct | 55334744261621 |
9 | 12043451651782 |
10 | 3122031322001 |
11 | aa4056321109 |
12 | 4250a1b81155 |
13 | 19853880a247 |
14 | ab16dd2ca9b |
15 | 56327be796b |
hex | 2d6e7916391 |
3122031322001 has 8 divisors (see below), whose sum is σ = 3143161017000. Its totient is φ = 3100903980160.
The previous prime is 3122031321979. The next prime is 3122031322043. The reversal of 3122031322001 is 1002231302213.
It can be written as a sum of positive squares in 4 ways, for example, as 75875457025 + 3046155864976 = 275455^2 + 1745324^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3122031322001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3122031322301) 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, 2116091 + ... + 3274431.
It is an arithmetic number, because the mean of its divisors is an integer number (392895127125).
Almost surely, 23122031322001 is an apocalyptic number.
It is an amenable number.
3122031322001 is a deficient number, since it is larger than the sum of its proper divisors (21129694999).
3122031322001 is a wasteful number, since it uses less digits than its factorization.
3122031322001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1176579.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 3122031322001 its reverse (1002231302213), we get a palindrome (4124262624214).
The spelling of 3122031322001 in words is "three trillion, one hundred twenty-two billion, thirty-one million, three hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •