Base | Representation |
---|---|
bin | 1001010010000000110101… |
… | …0101111001111101011011 |
3 | 1100010121001121100121000022 |
4 | 2110200031111321331123 |
5 | 2314144433413012111 |
6 | 33412050452101055 |
7 | 2102202023652242 |
oct | 224401525717533 |
9 | 40117047317008 |
10 | 10205066141531 |
11 | 3284a42878348 |
12 | 118998800478b |
13 | 590444c23781 |
14 | 273cdbdab959 |
15 | 12a6cd0362db |
hex | 9480d579f5b |
10205066141531 has 2 divisors, whose sum is σ = 10205066141532. Its totient is φ = 10205066141530.
The previous prime is 10205066141513. The next prime is 10205066141537. The reversal of 10205066141531 is 13514166050201.
Together with previous prime (10205066141513) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10205066141531 - 214 = 10205066125147 is a prime.
It is a super-2 number, since 2×102050661415312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10205066141491 and 10205066141500.
It is not a weakly prime, because it can be changed into another prime (10205066141537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5102533070765 + 5102533070766.
It is an arithmetic number, because the mean of its divisors is an integer number (5102533070766).
Almost surely, 210205066141531 is an apocalyptic number.
10205066141531 is a deficient number, since it is larger than the sum of its proper divisors (1).
10205066141531 is an equidigital number, since it uses as much as digits as its factorization.
10205066141531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 35.
The spelling of 10205066141531 in words is "ten trillion, two hundred five billion, sixty-six million, one hundred forty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •