Base | Representation |
---|---|
bin | 100011000110100100011… |
… | …011111000010101101101 |
3 | 22112121101211112012212201 |
4 | 203012210123320111231 |
5 | 304010224232101013 |
6 | 5044055440501501 |
7 | 336164304542332 |
oct | 43064433702555 |
9 | 8477354465781 |
10 | 2412235425133 |
11 | 850029013186 |
12 | 32b61091a891 |
13 | 14661ba45931 |
14 | 84a77a34989 |
15 | 42b33b4c3dd |
hex | 231a46f856d |
2412235425133 has 2 divisors, whose sum is σ = 2412235425134. Its totient is φ = 2412235425132.
The previous prime is 2412235425097. The next prime is 2412235425167. The reversal of 2412235425133 is 3315245322142.
2412235425133 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., 1581188047209 + 831047377924 = 1257453^2 + 911618^2 .
It is a cyclic number.
It is not a de Polignac number, because 2412235425133 - 233 = 2403645490541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2412235425092 and 2412235425101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2412235425533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1206117712566 + 1206117712567.
It is an arithmetic number, because the mean of its divisors is an integer number (1206117712567).
Almost surely, 22412235425133 is an apocalyptic number.
It is an amenable number.
2412235425133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2412235425133 is an equidigital number, since it uses as much as digits as its factorization.
2412235425133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 172800, while the sum is 37.
The spelling of 2412235425133 in words is "two trillion, four hundred twelve billion, two hundred thirty-five million, four hundred twenty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •