Base | Representation |
---|---|
bin | 10111010000101010011011… |
… | …100101010101011101000101 |
3 | 111102012210112201222210100202 |
4 | 113100222123211111131011 |
5 | 101402041142133434223 |
6 | 1001324011445420245 |
7 | 30355640603535524 |
oct | 2720523345253505 |
9 | 442183481883322 |
10 | 102300141311813 |
11 | 2a6612788a1985 |
12 | b58255240a685 |
13 | 4510b28885373 |
14 | 1b394d34aa4bb |
15 | bc60dc571428 |
hex | 5d0a9b955745 |
102300141311813 has 2 divisors, whose sum is σ = 102300141311814. Its totient is φ = 102300141311812.
The previous prime is 102300141311803. The next prime is 102300141311831. The reversal of 102300141311813 is 318113141003201.
Together with next prime (102300141311831) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101996405852929 + 303735458884 = 10099327^2 + 551122^2 .
It is a cyclic number.
It is not a de Polignac number, because 102300141311813 - 218 = 102300141049669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102300141311803) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51150070655906 + 51150070655907.
It is an arithmetic number, because the mean of its divisors is an integer number (51150070655907).
Almost surely, 2102300141311813 is an apocalyptic number.
It is an amenable number.
102300141311813 is a deficient number, since it is larger than the sum of its proper divisors (1).
102300141311813 is an equidigital number, since it uses as much as digits as its factorization.
102300141311813 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 29.
The spelling of 102300141311813 in words is "one hundred two trillion, three hundred billion, one hundred forty-one million, three hundred eleven thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •