Base | Representation |
---|---|
bin | 11101111111100001… |
… | …011011010011100111 |
3 | 10002010100221220100110 |
4 | 131333201123103213 |
5 | 1011423241140403 |
6 | 22443332344103 |
7 | 2220023344560 |
oct | 357741332347 |
9 | 102110856313 |
10 | 32204240103 |
11 | 127264aa272 |
12 | 62a9175033 |
13 | 3062c4c699 |
14 | 17b70ab167 |
15 | c873d2103 |
hex | 77f85b4e7 |
32204240103 has 16 divisors (see below), whose sum is σ = 49076276480. Its totient is φ = 18401242176.
The previous prime is 32204240099. The next prime is 32204240113. The reversal of 32204240103 is 30104240223.
It is not a de Polignac number, because 32204240103 - 22 = 32204240099 is a prime.
It is a super-2 number, since 2×322042401032 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 32204240103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32204240113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 368268 + ... + 447246.
It is an arithmetic number, because the mean of its divisors is an integer number (3067267280).
Almost surely, 232204240103 is an apocalyptic number.
32204240103 is a deficient number, since it is larger than the sum of its proper divisors (16872036377).
32204240103 is a wasteful number, since it uses less digits than its factorization.
32204240103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98406.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 32204240103 its reverse (30104240223), we get a palindrome (62308480326).
The spelling of 32204240103 in words is "thirty-two billion, two hundred four million, two hundred forty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •