Base | Representation |
---|---|
bin | 110101011101001010010110… |
… | …100001011100111011110001 |
3 | 1010211102101100020210210110111 |
4 | 311131022112201130323301 |
5 | 221303341202432400423 |
6 | 2152003353054301321 |
7 | 100343306124623203 |
oct | 6535122641347361 |
9 | 1124371306723414 |
10 | 235100445200113 |
11 | 68a015a2294439 |
12 | 2245005b4b7841 |
13 | a124b525aab2c |
14 | 420acca986773 |
15 | 1c2a77e91560d |
hex | d5d29685cef1 |
235100445200113 has 2 divisors, whose sum is σ = 235100445200114. Its totient is φ = 235100445200112.
The previous prime is 235100445200111. The next prime is 235100445200129. The reversal of 235100445200113 is 311002544001532.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 231833146740624 + 3267298459489 = 15226068^2 + 1807567^2 .
It is a cyclic number.
It is not a de Polignac number, because 235100445200113 - 21 = 235100445200111 is a prime.
Together with 235100445200111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (235100445200111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 117550222600056 + 117550222600057.
It is an arithmetic number, because the mean of its divisors is an integer number (117550222600057).
Almost surely, 2235100445200113 is an apocalyptic number.
It is an amenable number.
235100445200113 is a deficient number, since it is larger than the sum of its proper divisors (1).
235100445200113 is an equidigital number, since it uses as much as digits as its factorization.
235100445200113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 235100445200113 its reverse (311002544001532), we get a palindrome (546102989201645).
The spelling of 235100445200113 in words is "two hundred thirty-five trillion, one hundred billion, four hundred forty-five million, two hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •