Base | Representation |
---|---|
bin | 10111000011111011011001… |
… | …111001111000000101001101 |
3 | 111022010010200120201121021021 |
4 | 113003323121321320011031 |
5 | 101243221411432234113 |
6 | 555414001420434141 |
7 | 30235500246412213 |
oct | 2703733171700515 |
9 | 438103616647237 |
10 | 101425013555533 |
11 | 2a35411a009a08 |
12 | b460a1b9a8951 |
13 | 4479451021345 |
14 | 1b08dd54d2cb3 |
15 | bad46d8cd48d |
hex | 5c3ed9e7814d |
101425013555533 has 2 divisors, whose sum is σ = 101425013555534. Its totient is φ = 101425013555532.
The previous prime is 101425013555447. The next prime is 101425013555599. The reversal of 101425013555533 is 335555310524101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74852916490564 + 26572097064969 = 8651758^2 + 5154813^2 .
It is a cyclic number.
It is not a de Polignac number, because 101425013555533 - 225 = 101424980001101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101425013555533.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101425013550533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50712506777766 + 50712506777767.
It is an arithmetic number, because the mean of its divisors is an integer number (50712506777767).
Almost surely, 2101425013555533 is an apocalyptic number.
It is an amenable number.
101425013555533 is a deficient number, since it is larger than the sum of its proper divisors (1).
101425013555533 is an equidigital number, since it uses as much as digits as its factorization.
101425013555533 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 675000, while the sum is 43.
The spelling of 101425013555533 in words is "one hundred one trillion, four hundred twenty-five billion, thirteen million, five hundred fifty-five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •