Search a number
-
+
101091109010 = 2510109110901
BaseRepresentation
bin101111000100101111…
…1111110100010010010
3100122221012202102102112
41132021133332202102
53124013310442020
6114235101145322
710206063151223
oct1361137764222
9318835672375
10101091109010
1139966328491
121771325b242
1396c0899588
144c6dd2724a
152969e162c5
hex17897fe892

101091109010 has 8 divisors (see below), whose sum is σ = 181963996236. Its totient is φ = 40436443600.

The previous prime is 101091108997. The next prime is 101091109033. The reversal of 101091109010 is 10901190101.

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 96048546889 + 5042562121 = 309917^2 + 71011^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a super-3 number, since 3×1010911090103 (a number of 34 digits) contains 333 as substring.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5054555441 + ... + 5054555460.

Almost surely, 2101091109010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10109110908.

The product of its (nonzero) digits is 81, while the sum is 23.

Adding to 101091109010 its reverse (10901190101), we get a palindrome (111992299111).

The spelling of 101091109010 in words is "one hundred one billion, ninety-one million, one hundred nine thousand, ten".

Divisors: 1 2 5 10 10109110901 20218221802 50545554505 101091109010