Search a number
-
+
110210111012002 = 255105055506001
BaseRepresentation
bin11001000011110001001010…
…100001000111110010100010
3112110012222120010111002120111
4121003301022201013302202
5103421140301404341002
61030221454232001534
732133263201613631
oct3103611241076242
9473188503432514
10110210111012002
1132130933549361
121043b55b2302aa
1349659cc2a8971
141d302aac01518
15cb1c406723d7
hex643c4a847ca2

110210111012002 has 4 divisors (see below), whose sum is σ = 165315166518006. Its totient is φ = 55105055506000.

The previous prime is 110210111011999. The next prime is 110210111012017. The reversal of 110210111012002 is 200210111012011.

It is a happy number.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 109722293975281 + 487817036721 = 10474841^2 + 698439^2 .

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27552527752999 + ... + 27552527753002.

Almost surely, 2110210111012002 is an apocalyptic number.

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

110210111012002 is an equidigital number, since it uses as much as digits as its factorization.

110210111012002 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 55105055506003.

The product of its (nonzero) digits is 8, while the sum is 13.

Adding to 110210111012002 its reverse (200210111012011), we get a palindrome (310420222024013).

Subtracting 110210111012002 from its reverse (200210111012011), we obtain a palindrome (90000000000009).

The spelling of 110210111012002 in words is "one hundred ten trillion, two hundred ten billion, one hundred eleven million, twelve thousand, two".

Divisors: 1 2 55105055506001 110210111012002