Base | Representation |
---|---|
bin | 101101011100111001010… |
… | …001111111000011100001 |
3 | 102001121001021100121010210 |
4 | 231130321101333003201 |
5 | 402133211433141400 |
6 | 10350512101444333 |
7 | 441441550664151 |
oct | 55347121770341 |
9 | 12047037317123 |
10 | 3123402240225 |
11 | aa469a157283 |
12 | 4254051106a9 |
13 | 1986c6845967 |
14 | ab260030761 |
15 | 563a8245950 |
hex | 2d73947f0e1 |
3123402240225 has 48 divisors (see below), whose sum is σ = 5514420625920. Its totient is φ = 1556489625600.
The previous prime is 3123402240187. The next prime is 3123402240227. The reversal of 3123402240225 is 5220422043213.
It is not a de Polignac number, because 3123402240225 - 210 = 3123402239201 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3123402240192 and 3123402240201.
It is not an unprimeable number, because it can be changed into a prime (3123402240227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 23094624 + ... + 23229473.
It is an arithmetic number, because the mean of its divisors is an integer number (114883763040).
Almost surely, 23123402240225 is an apocalyptic number.
It is an amenable number.
3123402240225 is a deficient number, since it is larger than the sum of its proper divisors (2391018385695).
3123402240225 is a wasteful number, since it uses less digits than its factorization.
3123402240225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46324170 (or 46324165 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 30.
Adding to 3123402240225 its reverse (5220422043213), we get a palindrome (8343824283438).
The spelling of 3123402240225 in words is "three trillion, one hundred twenty-three billion, four hundred two million, two hundred forty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •