Base | Representation |
---|---|
bin | 100100100011101111000… |
… | …111001110100101100001 |
3 | 22220011121121000201012102 |
4 | 210203233013032211201 |
5 | 312130113233101431 |
6 | 5202042211340145 |
7 | 346335312223316 |
oct | 44435707164541 |
9 | 8804547021172 |
10 | 2512272550241 |
11 | 8894a33a5993 |
12 | 346a8abb1655 |
13 | 152ba215349c |
14 | 8984799ad0d |
15 | 4553b26bdcb |
hex | 248ef1ce961 |
2512272550241 has 2 divisors, whose sum is σ = 2512272550242. Its totient is φ = 2512272550240.
The previous prime is 2512272550211. The next prime is 2512272550253. The reversal of 2512272550241 is 1420552722152.
2512272550241 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., 2512272550225 + 16 = 1585015^2 + 4^2 .
It is a cyclic number.
It is not a de Polignac number, because 2512272550241 - 210 = 2512272549217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2512272550195 and 2512272550204.
It is not a weakly prime, because it can be changed into another prime (2512272550211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1256136275120 + 1256136275121.
It is an arithmetic number, because the mean of its divisors is an integer number (1256136275121).
Almost surely, 22512272550241 is an apocalyptic number.
It is an amenable number.
2512272550241 is a deficient number, since it is larger than the sum of its proper divisors (1).
2512272550241 is an equidigital number, since it uses as much as digits as its factorization.
2512272550241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112000, while the sum is 38.
The spelling of 2512272550241 in words is "two trillion, five hundred twelve billion, two hundred seventy-two million, five hundred fifty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •