Search a number
-
+
10241101102 = 214393558409
BaseRepresentation
bin10011000100110101…
…01100110100101110
3222102201102211122211
421202122230310232
5131433210213402
64412114201034
7511532631421
oct114232546456
928381384584
1010241101102
11438591a921
121b9988317a
13c7293554b
146d21a39b8
153ee1354d7
hex2626acd2e

10241101102 has 8 divisors (see below), whose sum is σ = 15372331200. Its totient is φ = 5116990704.

The previous prime is 10241101081. The next prime is 10241101109. The reversal of 10241101102 is 20110114201.

10241101102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10241101109) 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 3 ways as a sum of consecutive naturals, for example, 1776327 + ... + 1782082.

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

Almost surely, 210241101102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3559850.

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 10241101102 its reverse (20110114201), we get a palindrome (30351215303).

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

Divisors: 1 2 1439 2878 3558409 7116818 5120550551 10241101102