Search a number
-
+
1099010010901 = 11138777199683
BaseRepresentation
bin11111111111000100001…
…10011110111100010101
310220001201220020002222211
433333202012132330111
5121001233030322101
62200513410353421
7142254330646645
oct17774206367425
93801656202884
101099010010901
113940a6555590
12158bb428b871
137c8369648ca
143b299c04525
151d8c3aeac51
hexffe219ef15

1099010010901 has 8 divisors (see below), whose sum is σ = 1199006574624. Its totient is φ = 999027874320.

The previous prime is 1099010010859. The next prime is 1099010010911. The reversal of 1099010010901 is 1090100109901.

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

It is a cyclic number.

It is not a de Polignac number, because 1099010010901 - 217 = 1099009879829 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1099010010911) 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, 3447195 + ... + 3752488.

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

Almost surely, 21099010010901 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 7213571.

The product of its (nonzero) digits is 729, while the sum is 31.

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

Divisors: 1 11 13877 152647 7199683 79196513 99910000991 1099010010901