Base | Representation |
---|---|
bin | 100010111001111011100001… |
… | …100011101110000101000101 |
3 | 202010112211202211021221112011 |
4 | 202321323201203232011011 |
5 | 130110140201331043023 |
6 | 1302255331250254221 |
7 | 44223025360155001 |
oct | 4271734143560505 |
9 | 663484684257464 |
10 | 153514505331013 |
11 | 44a07155165302 |
12 | 15274181287371 |
13 | 6787481726188 |
14 | 29ca1dab91701 |
15 | 12b33e7e5750d |
hex | 8b9ee18ee145 |
153514505331013 has 2 divisors, whose sum is σ = 153514505331014. Its totient is φ = 153514505331012.
The previous prime is 153514505330981. The next prime is 153514505331101. The reversal of 153514505331013 is 310133505415351.
153514505331013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 153365016387969 + 149488943044 = 12384063^2 + 386638^2 .
It is a cyclic number.
It is not a de Polignac number, because 153514505331013 - 25 = 153514505330981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153514505331113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76757252665506 + 76757252665507.
It is an arithmetic number, because the mean of its divisors is an integer number (76757252665507).
Almost surely, 2153514505331013 is an apocalyptic number.
It is an amenable number.
153514505331013 is a deficient number, since it is larger than the sum of its proper divisors (1).
153514505331013 is an equidigital number, since it uses as much as digits as its factorization.
153514505331013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 202500, while the sum is 40.
The spelling of 153514505331013 in words is "one hundred fifty-three trillion, five hundred fourteen billion, five hundred five million, three hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •