Base | Representation |
---|---|
bin | 110110110110101011101010… |
… | …111111011011100110110101 |
3 | 1011122012111020111020021200012 |
4 | 312312223222333123212311 |
5 | 223110134104402404023 |
6 | 2213033431155230005 |
7 | 101546620535534663 |
oct | 6666535277334665 |
9 | 1148174214207605 |
10 | 241252255513013 |
11 | 6a9635638928a8 |
12 | 230843782a8305 |
13 | a47ccb427b234 |
14 | 4380958725c33 |
15 | 1cd57d1371978 |
hex | db6aeafdb9b5 |
241252255513013 has 2 divisors, whose sum is σ = 241252255513014. Its totient is φ = 241252255513012.
The previous prime is 241252255512977. The next prime is 241252255513067. The reversal of 241252255513013 is 310315552252142.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 240884585488849 + 367670024164 = 15520457^2 + 606358^2 .
It is a cyclic number.
It is not a de Polignac number, because 241252255513013 - 212 = 241252255508917 is a prime.
It is a super-2 number, since 2×2412522555130132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241252255513513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120626127756506 + 120626127756507.
It is an arithmetic number, because the mean of its divisors is an integer number (120626127756507).
Almost surely, 2241252255513013 is an apocalyptic number.
It is an amenable number.
241252255513013 is a deficient number, since it is larger than the sum of its proper divisors (1).
241252255513013 is an equidigital number, since it uses as much as digits as its factorization.
241252255513013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 360000, while the sum is 41.
The spelling of 241252255513013 in words is "two hundred forty-one trillion, two hundred fifty-two billion, two hundred fifty-five million, five hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •