Search a number
-
+
110001010010 = 2515172848351
BaseRepresentation
bin110011001110010010…
…0100011010101011010
3101111221011022021211212
41212130210203111122
53300240224310020
6122311143223122
710642633105043
oct1463444432532
9344834267755
10110001010010
114271877aa31
121939b147aa2
13a4b0791848
1454773a78ca
152cdc246cc5
hex199c92355a

110001010010 has 16 divisors (see below), whose sum is σ = 199313091072. Its totient is φ = 43709010000.

The previous prime is 110001009977. The next prime is 110001010019. The reversal of 110001010010 is 10010100011.

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 = 110001009976 and 110001010003.

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

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

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

Almost surely, 2110001010010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 72848509.

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

Adding to 110001010010 its reverse (10010100011), we get a palindrome (120011110021).

Subtracting from 110001010010 its reverse (10010100011), we obtain a palindrome (99990909999).

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

Divisors: 1 2 5 10 151 302 755 1510 72848351 145696702 364241755 728483510 11000101001 22000202002 55000505005 110001010010