Base | Representation |
---|---|
bin | 110101001100000001… |
… | …1111000001100011101 |
3 | 101220211012122120220112 |
4 | 1222120003320030131 |
5 | 3332410344200013 |
6 | 124245545255405 |
7 | 11152325362136 |
oct | 1523003701435 |
9 | 356735576815 |
10 | 114220303133 |
11 | 44493424342 |
12 | 1a178194565 |
13 | aa03963cb1 |
14 | 57578c2c8d |
15 | 2e87887ba8 |
hex | 1a980f831d |
114220303133 has 2 divisors, whose sum is σ = 114220303134. Its totient is φ = 114220303132.
The previous prime is 114220303111. The next prime is 114220303163. The reversal of 114220303133 is 331303022411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74012834809 + 40207468324 = 272053^2 + 200518^2 .
It is a cyclic number.
It is not a de Polignac number, because 114220303133 - 28 = 114220302877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114220303099 and 114220303108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114220303163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57110151566 + 57110151567.
It is an arithmetic number, because the mean of its divisors is an integer number (57110151567).
Almost surely, 2114220303133 is an apocalyptic number.
It is an amenable number.
114220303133 is a deficient number, since it is larger than the sum of its proper divisors (1).
114220303133 is an equidigital number, since it uses as much as digits as its factorization.
114220303133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 114220303133 its reverse (331303022411), we get a palindrome (445523325544).
The spelling of 114220303133 in words is "one hundred fourteen billion, two hundred twenty million, three hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •