Search a number
-
+
100010148572 = 22171470737479
BaseRepresentation
bin101110100100100010…
…0011100001011011100
3100120010212201221110202
41131021010130023130
53114310044223242
6113535524323032
710140226144115
oct1351104341334
9316125657422
10100010148572
1139461137954
1217471243478
13957a953b09
144baa54320c
152905091932
hex174911c2dc

100010148572 has 12 divisors (see below), whose sum is σ = 185312922480. Its totient is φ = 47063599296.

The previous prime is 100010148571. The next prime is 100010148631. The reversal of 100010148572 is 275841010001.

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

It is a congruent number.

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

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

Almost surely, 2100010148572 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1470737500 (or 1470737498 counting only the distinct ones).

The product of its (nonzero) digits is 2240, while the sum is 29.

Adding to 100010148572 its reverse (275841010001), we get a palindrome (375851158573).

The spelling of 100010148572 in words is "one hundred billion, ten million, one hundred forty-eight thousand, five hundred seventy-two".

Divisors: 1 2 4 17 34 68 1470737479 2941474958 5882949916 25002537143 50005074286 100010148572