Search a number
-
+
110001010011002 = 2111722361891271091
BaseRepresentation
bin11001000000101110011011…
…001000000110101101111010
3112102110222211112001122201222
4121000232123020012231322
5103404224032030323002
61025541433311512042
732112211400464205
oct3100563310065572
9472428745048658
10110001010011002
1132060191481430
1210406b23828622
13494c0876051c6
141d2411213693c
15cab5a32201a2
hex640b9b206b7a

110001010011002 has 384 divisors, whose sum is σ = 206880198819840. Its totient is φ = 43393287168000.

The previous prime is 110001010010897. The next prime is 110001010011007. The reversal of 110001010011002 is 200110010100011.

It is a happy number.

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

It is not an unprimeable number, because it can be changed into a prime (110001010011007) by changing a digit.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 100825856477 + ... + 100825857567.

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

Almost surely, 2110001010011002 is an apocalyptic number.

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

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

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

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

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

Adding to 110001010011002 its reverse (200110010100011), we get a palindrome (310111020111013).

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