Base | Representation |
---|---|
bin | 11001111111010100010000… |
… | …100110101101010101110101 |
3 | 112222201012001212012110100102 |
4 | 121333110100212231111311 |
5 | 104440211443231343333 |
6 | 1043033420423123445 |
7 | 33035031066560561 |
oct | 3177242046552565 |
9 | 488635055173312 |
10 | 114302243231093 |
11 | 334693444a5855 |
12 | 109a0659ba3585 |
13 | 4ba1869885568 |
14 | 20323882b46a1 |
15 | d333e4c87ae8 |
hex | 67f5109ad575 |
114302243231093 has 2 divisors, whose sum is σ = 114302243231094. Its totient is φ = 114302243231092.
The previous prime is 114302243231003. The next prime is 114302243231131. The reversal of 114302243231093 is 390132342203411.
It is an a-pointer prime, because the next prime (114302243231131) can be obtained adding 114302243231093 to its sum of digits (38).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114018359931844 + 283883299249 = 10677938^2 + 532807^2 .
It is a cyclic number.
It is not a de Polignac number, because 114302243231093 - 216 = 114302243165557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114302243231003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57151121615546 + 57151121615547.
It is an arithmetic number, because the mean of its divisors is an integer number (57151121615547).
Almost surely, 2114302243231093 is an apocalyptic number.
It is an amenable number.
114302243231093 is a deficient number, since it is larger than the sum of its proper divisors (1).
114302243231093 is an equidigital number, since it uses as much as digits as its factorization.
114302243231093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 93312, while the sum is 38.
The spelling of 114302243231093 in words is "one hundred fourteen trillion, three hundred two billion, two hundred forty-three million, two hundred thirty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •