Search a number
BaseRepresentation
bin11001000010001100011110…
…101101111110010100111100
3112102211122111211022022201211
4121002030132231332110330
5103412402400003014322
61030100054512414204
732122415151313354
oct3102143655762474
9472748454268654
10110102002001212
1132099aa685a451
1210422609847364
1349587607a90b0
141d28d72c1bb64
15cae0145a7b77
hex64231eb7e53c

110102002001212 has 24 divisors (see below), whose sum is σ = 207506628400176. Its totient is φ = 50814667419648.

The previous prime is 110102002001203. The next prime is 110102002001231. The reversal of 110102002001212 is 212100200201011.

Adding to 110102002001212 its reverse (212100200201011), we get a palindrome (322202202202223).

It is a super-3 number, since 3×1101020020012123 (a number of 43 digits) contains 333 as substring.

It is a Harshad number since it is a multiple of its sum of digits (13).

It is a junction number, because it is equal to n+sod(n) for n = 110102002001192 and 110102002001201.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32565298 + ... + 35786905.

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

Almost surely, 2110102002001212 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 68383197 (or 68383195 counting only the distinct ones).

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

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