Search a number
-
+
105013201132 = 22711333190013
BaseRepresentation
bin110000111001101000…
…1100100100011101100
3101001001112212100100201
41201303101210203230
53210031334414012
6120124205203244
710405216324150
oct1416321444354
9331045770321
10105013201132
114059923a334
1218428860524
139b97310c48
145122b9b060
152ae93ec857
hex18734648ec

105013201132 has 24 divisors (see below), whose sum is σ = 211885049376. Its totient is φ = 44607376128.

The previous prime is 105013201129. The next prime is 105013201147. The reversal of 105013201132 is 231102310501.

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

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 16591843 + ... + 16598170.

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

Almost surely, 2105013201132 is an apocalyptic number.

It is an amenable number.

105013201132 is an abundant number, since it is smaller than the sum of its proper divisors (106871848244).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 180, while the sum is 19.

Adding to 105013201132 its reverse (231102310501), we get a palindrome (336115511633).

The spelling of 105013201132 in words is "one hundred five billion, thirteen million, two hundred one thousand, one hundred thirty-two".

Divisors: 1 2 4 7 14 28 113 226 452 791 1582 3164 33190013 66380026 132760052 232330091 464660182 929320364 3750471469 7500942938 15001885876 26253300283 52506600566 105013201132