Search a number
-
+
110212121022002 = 2419131518044179
BaseRepresentation
bin11001000011110011000010…
…010100101100111000110010
3112110020011202012200011221022
4121003303002110230320302
5103421203410440201002
61030222425513255442
732133364046456246
oct3103630224547062
9473204665604838
10110212121022002
113213177510264a
121043ba20404582
134965c5c8492ac
141d3041bb44426
15cb1d0bd60ba2
hex643cc252ce32

110212121022002 has 8 divisors (see below), whose sum is σ = 165712735666800. Its totient is φ = 54974542466404.

The previous prime is 110212121021941. The next prime is 110212121022011. The reversal of 110212121022002 is 200220121212011.

110212121022002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65759021252 + ... + 65759022927.

It is an arithmetic number, because the mean of its divisors is an integer number (20714091958350).

Almost surely, 2110212121022002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 131518044600.

The product of its (nonzero) digits is 64, while the sum is 17.

Adding to 110212121022002 its reverse (200220121212011), we get a palindrome (310432242234013).

The spelling of 110212121022002 in words is "one hundred ten trillion, two hundred twelve billion, one hundred twenty-one million, twenty-two thousand, two".

Divisors: 1 2 419 838 131518044179 263036088358 55106060511001 110212121022002