Search a number
-
+
100110010002 = 2337450945991
BaseRepresentation
bin101110100111100000…
…1011000011010010010
3100120101211122102121020
41131033001120122102
53120011130310002
6113553452540310
710142551021242
oct1351701303222
9316354572536
10100110010002
1139502544262
121749a781696
139595549512
144bb98d9b22
15290dc1a2bc
hex174f058692

100110010002 has 16 divisors (see below), whose sum is σ = 205631372352. Its totient is φ = 32468111280.

The previous prime is 100110009983. The next prime is 100110010003. The reversal of 100110010002 is 200010011001.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2100110010002 is an apocalyptic number.

100110010002 is an abundant number, since it is smaller than the sum of its proper divisors (105521362350).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 450946033.

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

Adding to 100110010002 its reverse (200010011001), we get a palindrome (300120021003).

Subtracting 100110010002 from its reverse (200010011001), we obtain a palindrome (99900000999).

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

Divisors: 1 2 3 6 37 74 111 222 450945991 901891982 1352837973 2705675946 16685001667 33370003334 50055005001 100110010002