Base | Representation |
---|---|
bin | 101101011100111111001… |
… | …000001010110000100101 |
3 | 102001121022002221002001012 |
4 | 231130333020022300211 |
5 | 402133412041030041 |
6 | 10350525524112005 |
7 | 441444151512221 |
oct | 55347710126045 |
9 | 12047262832035 |
10 | 3123500330021 |
11 | aa473a563625 |
12 | 425431b35605 |
13 | 198710c6ab66 |
14 | ab26d085781 |
15 | 563b1b6e3eb |
hex | 2d73f20ac25 |
3123500330021 has 2 divisors, whose sum is σ = 3123500330022. Its totient is φ = 3123500330020.
The previous prime is 3123500329997. The next prime is 3123500330029. The reversal of 3123500330021 is 1200330053213.
3123500330021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3085330893121 + 38169436900 = 1756511^2 + 195370^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3123500330021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3123500330029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1561750165010 + 1561750165011.
It is an arithmetic number, because the mean of its divisors is an integer number (1561750165011).
Almost surely, 23123500330021 is an apocalyptic number.
It is an amenable number.
3123500330021 is a deficient number, since it is larger than the sum of its proper divisors (1).
3123500330021 is an equidigital number, since it uses as much as digits as its factorization.
3123500330021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 23.
Adding to 3123500330021 its reverse (1200330053213), we get a palindrome (4323830383234).
The spelling of 3123500330021 in words is "three trillion, one hundred twenty-three billion, five hundred million, three hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •