Base | Representation |
---|---|
bin | 110101001110101111… |
… | …0000101111010001101 |
3 | 101221001112102120110221 |
4 | 1222131132011322031 |
5 | 3333102112424013 |
6 | 124302550431341 |
7 | 11154506662543 |
oct | 1523536057215 |
9 | 357045376427 |
10 | 114311061133 |
11 | 4452a683155 |
12 | 1a1a2662551 |
13 | aa196bcc59 |
14 | 5765989d93 |
15 | 2e9081408d |
hex | 1a9d785e8d |
114311061133 has 2 divisors, whose sum is σ = 114311061134. Its totient is φ = 114311061132.
The previous prime is 114311061107. The next prime is 114311061169. The reversal of 114311061133 is 331160113411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95395735044 + 18915326089 = 308862^2 + 137533^2 .
It is a cyclic number.
It is not a de Polignac number, because 114311061133 - 233 = 105721126541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114311061098 and 114311061107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114311061433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57155530566 + 57155530567.
It is an arithmetic number, because the mean of its divisors is an integer number (57155530567).
Almost surely, 2114311061133 is an apocalyptic number.
It is an amenable number.
114311061133 is a deficient number, since it is larger than the sum of its proper divisors (1).
114311061133 is an equidigital number, since it uses as much as digits as its factorization.
114311061133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 114311061133 its reverse (331160113411), we get a palindrome (445471174544).
It can be divided in two parts, 1143 and 11061133, that added together give a square (11062276 = 33262).
The spelling of 114311061133 in words is "one hundred fourteen billion, three hundred eleven million, sixty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •