Base | Representation |
---|---|
bin | 1001010100001010111111… |
… | …0110011011011000110101 |
3 | 1100021010210012112101011012 |
4 | 2111002233312123120311 |
5 | 2320301411443030141 |
6 | 33441102501322005 |
7 | 2104654040143256 |
oct | 225025766333065 |
9 | 40233705471135 |
10 | 10242152314421 |
11 | 3299743a72a05 |
12 | 1194bb8106305 |
13 | 593aa5403781 |
14 | 275a195a4b2d |
15 | 12b64dcebceb |
hex | 950afd9b635 |
10242152314421 has 2 divisors, whose sum is σ = 10242152314422. Its totient is φ = 10242152314420.
The previous prime is 10242152314411. The next prime is 10242152314547. The reversal of 10242152314421 is 12441325124201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10082720608900 + 159431705521 = 3175330^2 + 399289^2 .
It is an emirp because it is prime and its reverse (12441325124201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10242152314421 - 222 = 10242148120117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10242152314411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5121076157210 + 5121076157211.
It is an arithmetic number, because the mean of its divisors is an integer number (5121076157211).
Almost surely, 210242152314421 is an apocalyptic number.
It is an amenable number.
10242152314421 is a deficient number, since it is larger than the sum of its proper divisors (1).
10242152314421 is an equidigital number, since it uses as much as digits as its factorization.
10242152314421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15360, while the sum is 32.
Adding to 10242152314421 its reverse (12441325124201), we get a palindrome (22683477438622).
The spelling of 10242152314421 in words is "ten trillion, two hundred forty-two billion, one hundred fifty-two million, three hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •