Base | Representation |
---|---|
bin | 1001011110001101001010… |
… | …0100100011110000110101 |
3 | 1100212121201202012011110121 |
4 | 2113203102210203300311 |
5 | 2331112431040241113 |
6 | 34052212021051541 |
7 | 2123265564226045 |
oct | 227432244436065 |
9 | 40777652164417 |
10 | 10414533524533 |
11 | 3355862739516 |
12 | 12024a6256bb1 |
13 | 5a7117797b08 |
14 | 2800cd5a9725 |
15 | 130d8c70ae8d |
hex | 978d2923c35 |
10414533524533 has 2 divisors, whose sum is σ = 10414533524534. Its totient is φ = 10414533524532.
The previous prime is 10414533524531. The next prime is 10414533524569. The reversal of 10414533524533 is 33542533541401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7755099900804 + 2659433623729 = 2784798^2 + 1630777^2 .
It is a cyclic number.
It is not a de Polignac number, because 10414533524533 - 21 = 10414533524531 is a prime.
Together with 10414533524531, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10414533524533.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10414533524531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5207266762266 + 5207266762267.
It is an arithmetic number, because the mean of its divisors is an integer number (5207266762267).
Almost surely, 210414533524533 is an apocalyptic number.
It is an amenable number.
10414533524533 is a deficient number, since it is larger than the sum of its proper divisors (1).
10414533524533 is an equidigital number, since it uses as much as digits as its factorization.
10414533524533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296000, while the sum is 43.
The spelling of 10414533524533 in words is "ten trillion, four hundred fourteen billion, five hundred thirty-three million, five hundred twenty-four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •