Base | Representation |
---|---|
bin | 110101001111010101… |
… | …1010011010011100101 |
3 | 101221002221111212111002 |
4 | 1222132223103103211 |
5 | 3333122303113333 |
6 | 124304552323045 |
7 | 11155144011302 |
oct | 1523653232345 |
9 | 357087455432 |
10 | 114331301093 |
11 | 44540047799 |
12 | 1a1a93a3485 |
13 | aa20958669 |
14 | 57685380a9 |
15 | 2e924b10e8 |
hex | 1a9ead34e5 |
114331301093 has 2 divisors, whose sum is σ = 114331301094. Its totient is φ = 114331301092.
The previous prime is 114331301089. The next prime is 114331301141. The reversal of 114331301093 is 390103133411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67258791649 + 47072509444 = 259343^2 + 216962^2 .
It is a cyclic number.
It is not a de Polignac number, because 114331301093 - 22 = 114331301089 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114331301893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57165650546 + 57165650547.
It is an arithmetic number, because the mean of its divisors is an integer number (57165650547).
Almost surely, 2114331301093 is an apocalyptic number.
It is an amenable number.
114331301093 is a deficient number, since it is larger than the sum of its proper divisors (1).
114331301093 is an equidigital number, since it uses as much as digits as its factorization.
114331301093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 114331301093 in words is "one hundred fourteen billion, three hundred thirty-one million, three hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •