Search a number
-
+
29013149568 = 27313191132707
BaseRepresentation
bin11011000001010100…
…011000011110000000
32202212222100201002010
4123001110120132000
5433404331241233
621154540252520
72044654462614
oct330124303600
982788321063
1029013149568
1111339191767
125758541140
132974ab0230
141593361344
15b4c193b63
hex6c1518780

29013149568 has 256 divisors, whose sum is σ = 88168147200. Its totient is φ = 8379334656.

The previous prime is 29013149537. The next prime is 29013149573. The reversal of 29013149568 is 86594131092.

It is a Harshad number since it is a multiple of its sum of digits (48).

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10716471 + ... + 10719177.

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

Almost surely, 229013149568 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 29013149568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44084073600).

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

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

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

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

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

The product of its (nonzero) digits is 466560, while the sum is 48.

The spelling of 29013149568 in words is "twenty-nine billion, thirteen million, one hundred forty-nine thousand, five hundred sixty-eight".