Search a number
-
+
32101013032 = 23111182130859
BaseRepresentation
bin11101111001010111…
…101001011000101000
310001212011201102102121
4131321113221120220
51011220324404112
622425204041024
72214331052164
oct357127513050
9101764642377
1032101013032
1112683204240
12627a693174
13304774908a
1417a74b9ca4
15c7d2e1407
hex7795e9628

32101013032 has 32 divisors (see below), whose sum is σ = 65668845600. Its totient is φ = 14589662400.

The previous prime is 32101012961. The next prime is 32101013059. The reversal of 32101013032 is 23031010123.

It is a junction number, because it is equal to n+sod(n) for n = 32101012997 and 32101013015.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1024819 + ... + 1055677.

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

Almost surely, 232101013032 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

Adding to 32101013032 its reverse (23031010123), we get a palindrome (55132023155).

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

Divisors: 1 2 4 8 11 22 44 88 11821 23642 30859 47284 61718 94568 123436 130031 246872 260062 339449 520124 678898 1040248 1357796 2715592 364784239 729568478 1459136956 2918273912 4012626629 8025253258 16050506516 32101013032