Base | Representation |
---|---|
bin | 1001010100000111001010… |
… | …1101011010011111000011 |
3 | 1100021001010201100200220022 |
4 | 2111001302231122133003 |
5 | 2320242311343310001 |
6 | 33440413015404055 |
7 | 2104616443210034 |
oct | 225016255323703 |
9 | 40231121320808 |
10 | 10241126541251 |
11 | 3299267a46391 |
12 | 119497068362b |
13 | 593970a414b8 |
14 | 27595d268a8b |
15 | 12b5ddc2911b |
hex | 95072b5a7c3 |
10241126541251 has 2 divisors, whose sum is σ = 10241126541252. Its totient is φ = 10241126541250.
The previous prime is 10241126541203. The next prime is 10241126541263. The reversal of 10241126541251 is 15214562114201.
10241126541251 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 is a cyclic number.
It is not a de Polignac number, because 10241126541251 - 242 = 5843080030147 is a prime.
It is a super-3 number, since 3×102411265412513 (a number of 40 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (10241126543251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5120563270625 + 5120563270626.
It is an arithmetic number, because the mean of its divisors is an integer number (5120563270626).
Almost surely, 210241126541251 is an apocalyptic number.
10241126541251 is a deficient number, since it is larger than the sum of its proper divisors (1).
10241126541251 is an equidigital number, since it uses as much as digits as its factorization.
10241126541251 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19200, while the sum is 35.
Adding to 10241126541251 its reverse (15214562114201), we get a palindrome (25455688655452).
The spelling of 10241126541251 in words is "ten trillion, two hundred forty-one billion, one hundred twenty-six million, five hundred forty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •