Base | Representation |
---|---|
bin | 1001010100000111001010… |
… | …1101010000111010001101 |
3 | 1100021001010201021201002122 |
4 | 2111001302231100322031 |
5 | 2320242311341031104 |
6 | 33440413014502325 |
7 | 2104616442654503 |
oct | 225016255207215 |
9 | 40231121251078 |
10 | 10241126502029 |
11 | 3299267a19975 |
12 | 11949706649a5 |
13 | 593970a296a7 |
14 | 27595d258673 |
15 | 12b5ddc1c6be |
hex | 95072b50e8d |
10241126502029 has 2 divisors, whose sum is σ = 10241126502030. Its totient is φ = 10241126502028.
The previous prime is 10241126502011. The next prime is 10241126502041. The reversal of 10241126502029 is 92020562114201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10241107229929 + 19272100 = 3200173^2 + 4390^2 .
It is a cyclic number.
It is not a de Polignac number, because 10241126502029 - 28 = 10241126501773 is a prime.
It is a super-2 number, since 2×102411265020292 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10241126502029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10241126502049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5120563251014 + 5120563251015.
It is an arithmetic number, because the mean of its divisors is an integer number (5120563251015).
Almost surely, 210241126502029 is an apocalyptic number.
It is an amenable number.
10241126502029 is a deficient number, since it is larger than the sum of its proper divisors (1).
10241126502029 is an equidigital number, since it uses as much as digits as its factorization.
10241126502029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17280, while the sum is 35.
The spelling of 10241126502029 in words is "ten trillion, two hundred forty-one billion, one hundred twenty-six million, five hundred two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •