Search a number
-
+
110010020021002 = 24312296106341
BaseRepresentation
bin11001000000110110110100…
…001010100100001100001010
3112102111212002102222120220001
4121000312310022210030022
5103404401010111133002
61025545523331353214
732112650564346013
oct3100666412441412
9472455072876801
10110010020021002
1132063a9538a292
121040881915280a
13494cb9217b77a
141d247289d600a
15cab92e227a87
hex640db42a430a

110010020021002 has 12 divisors (see below), whose sum is σ = 165398784408018. Its totient is φ = 54877387992200.

The previous prime is 110010020020991. The next prime is 110010020021021. The reversal of 110010020021002 is 200120020010011.

It can be written as a sum of positive squares in only one way, i.e., 97849309718161 + 12160710302841 = 9891881^2 + 3487221^2 .

It is a self number, because there is not a number n which added to its sum of digits gives 110010020021002.

It is an unprimeable number.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 147681649 + ... + 148424692.

Almost surely, 2110010020021002 is an apocalyptic number.

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

110010020021002 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 110010020021002 its reverse (200120020010011), we get a palindrome (310130040031013).

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

Divisors: 1 2 431 862 185761 371522 296106341 592212682 127621832971 255243665942 55005010010501 110010020021002