Base | Representation |
---|---|
bin | 11110011000100000… |
… | …011100101100100010 |
3 | 10010012120201010220110 |
4 | 132120200130230202 |
5 | 1013303043222200 |
6 | 22553104552150 |
7 | 2233303305213 |
oct | 363040345442 |
9 | 103176633813 |
10 | 32623414050 |
11 | 12921080917 |
12 | 63a5622656 |
13 | 30cba453c6 |
14 | 1816a2340a |
15 | cae0d1b50 |
hex | 79881cb22 |
32623414050 has 48 divisors (see below), whose sum is σ = 80924954400. Its totient is φ = 8697546240.
The previous prime is 32623414037. The next prime is 32623414051. The reversal of 32623414050 is 5041432623.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 32623413999 and 32623414017.
It is not an unprimeable number, because it can be changed into a prime (32623414051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 685426 + ... + 731474.
It is an arithmetic number, because the mean of its divisors is an integer number (1685936550).
Almost surely, 232623414050 is an apocalyptic number.
32623414050 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
32623414050 is an abundant number, since it is smaller than the sum of its proper divisors (48301540350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32623414050 is a wasteful number, since it uses less digits than its factorization.
32623414050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50787 (or 50782 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 32623414050 its reverse (5041432623), we get a palindrome (37664846673).
The spelling of 32623414050 in words is "thirty-two billion, six hundred twenty-three million, four hundred fourteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •