Base | Representation |
---|---|
bin | 100011011110101100111001… |
… | …100111100011101011100101 |
3 | 202110111102012002122021112112 |
4 | 203132230321213203223211 |
5 | 130423040313404031203 |
6 | 1311512235040330405 |
7 | 44603422640214245 |
oct | 4336547147435345 |
9 | 673442162567475 |
10 | 156041423502053 |
11 | 457a0883636931 |
12 | 15601a59013a05 |
13 | 690b848b6816b |
14 | 2a76633885b25 |
15 | 1308eded376d8 |
hex | 8deb399e3ae5 |
156041423502053 has 2 divisors, whose sum is σ = 156041423502054. Its totient is φ = 156041423502052.
The previous prime is 156041423502047. The next prime is 156041423502067. The reversal of 156041423502053 is 350205324140651.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145005958752964 + 11035464749089 = 12041842^2 + 3321967^2 .
It is a cyclic number.
It is not a de Polignac number, because 156041423502053 - 214 = 156041423485669 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 156041423502053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (156041423502023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78020711751026 + 78020711751027.
It is an arithmetic number, because the mean of its divisors is an integer number (78020711751027).
Almost surely, 2156041423502053 is an apocalyptic number.
It is an amenable number.
156041423502053 is a deficient number, since it is larger than the sum of its proper divisors (1).
156041423502053 is an equidigital number, since it uses as much as digits as its factorization.
156041423502053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432000, while the sum is 41.
The spelling of 156041423502053 in words is "one hundred fifty-six trillion, forty-one billion, four hundred twenty-three million, five hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •