Search a number
-
+
100110010010 = 2573311365571
BaseRepresentation
bin101110100111100000…
…1011000011010011010
3100120101211122102121112
41131033001120122122
53120011130310020
6113553452540322
710142551021253
oct1351701303232
9316354572545
10100110010010
113950254426a
121749a7816a2
13959554951a
144bb98d9b2a
15290dc1a2c5
hex174f05869a

100110010010 has 16 divisors (see below), whose sum is σ = 180222730272. Its totient is φ = 40038512400.

The previous prime is 100110010003. The next prime is 100110010087. The reversal of 100110010010 is 10010011001.

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

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

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, 609476 + ... + 756095.

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

Almost surely, 2100110010010 is an apocalyptic number.

100110010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1372909.

The product of its (nonzero) digits is 1, while the sum is 5.

Adding to 100110010010 its reverse (10010011001), we get a palindrome (110120021011).

Subtracting from 100110010010 its reverse (10010011001), we obtain a palindrome (90099999009).

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

Divisors: 1 2 5 10 7331 14662 36655 73310 1365571 2731142 6827855 13655710 10011001001 20022002002 50055005005 100110010010