Search a number
-
+
110133101362 = 21409272914321
BaseRepresentation
bin110011010010001110…
…0011100001100110010
3101112021100212020010011
41212210130130030302
53301023033220422
6122332222325134
710646125626034
oct1464434341462
9345240766104
10110133101362
11427862a0139
12194174297aa
13a501c601cb
14548ab4dc54
152ce8b3a077
hex19a471c332

110133101362 has 16 divisors (see below), whose sum is σ = 165389023800. Its totient is φ = 55003463680.

The previous prime is 110133101251. The next prime is 110133101363. The reversal of 110133101362 is 263101331011.

It can be written as a sum of positive squares in 4 ways, for example, as 56595934201 + 53537167161 = 237899^2 + 231381^2 .

It is a super-2 number, since 2×1101331013622 (a number of 23 digits) contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (110133101363) 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 in 7 ways as a sum of consecutive naturals, for example, 7683162 + ... + 7697482.

Almost surely, 2110133101362 is an apocalyptic number.

110133101362 is a deficient number, since it is larger than the sum of its proper divisors (55255922438).

110133101362 is a wasteful number, since it uses less digits than its factorization.

110133101362 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 18461.

The product of its (nonzero) digits is 324, while the sum is 22.

Adding to 110133101362 its reverse (263101331011), we get a palindrome (373234432373).

The spelling of 110133101362 in words is "one hundred ten billion, one hundred thirty-three million, one hundred one thousand, three hundred sixty-two".

Divisors: 1 2 1409 2729 2818 5458 14321 28642 3845161 7690322 20178289 39082009 40356578 78164018 55066550681 110133101362