Base | Representation |
---|---|
bin | 110100101101111111… |
… | …0000101000101011101 |
3 | 101211012221122002221122 |
4 | 1221123332011011131 |
5 | 3323324302300414 |
6 | 124001533140325 |
7 | 11115334253402 |
oct | 1513376050535 |
9 | 354187562848 |
10 | 113212150109 |
11 | 44016342023 |
12 | 19b3662a6a5 |
13 | a8a2b30b46 |
14 | 569da522a9 |
15 | 2e290e5b8e |
hex | 1a5bf8515d |
113212150109 has 2 divisors, whose sum is σ = 113212150110. Its totient is φ = 113212150108.
The previous prime is 113212150099. The next prime is 113212150141. The reversal of 113212150109 is 901051212311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83284188100 + 29927962009 = 288590^2 + 172997^2 .
It is a cyclic number.
It is not a de Polignac number, because 113212150109 - 236 = 44492673373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113212150409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56606075054 + 56606075055.
It is an arithmetic number, because the mean of its divisors is an integer number (56606075055).
Almost surely, 2113212150109 is an apocalyptic number.
It is an amenable number.
113212150109 is a deficient number, since it is larger than the sum of its proper divisors (1).
113212150109 is an equidigital number, since it uses as much as digits as its factorization.
113212150109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 26.
The spelling of 113212150109 in words is "one hundred thirteen billion, two hundred twelve million, one hundred fifty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •