Base | Representation |
---|---|
bin | 11110000100111000… |
… | …101010000010100000 |
3 | 10002100122021010212011 |
4 | 132010320222002200 |
5 | 1012114304401330 |
6 | 22500305042304 |
7 | 2222165206525 |
oct | 360470520240 |
9 | 102318233764 |
10 | 32294215840 |
11 | 12772274387 |
12 | 6313326394 |
13 | 3078793573 |
14 | 17c500d14c |
15 | c9025682a |
hex | 784e2a0a0 |
32294215840 has 36 divisors (see below), whose sum is σ = 76300455546. Its totient is φ = 12916777088.
The previous prime is 32294215823. The next prime is 32294215853. The reversal of 32294215840 is 4851249223.
It can be written as a sum of positive squares in only one way, i.e., 29064794256 + 3229421584 = 170484^2 + 56828^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 32294215793 and 32294215802.
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 5 ways as a sum of consecutive naturals, for example, 2266017 + ... + 2280223.
Almost surely, 232294215840 is an apocalyptic number.
It is an amenable number.
32294215840 is an abundant number, since it is smaller than the sum of its proper divisors (44006239706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32294215840 is an frugal number, since it uses more digits than its factorization.
32294215840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28429 (or 14214 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 40.
Multiplying 32294215840 by its sum of digits (40), we get a square (1291768633600 = 11365602).
32294215840 divided by its sum of digits (40) gives a square (807355396 = 284142).
The spelling of 32294215840 in words is "thirty-two billion, two hundred ninety-four million, two hundred fifteen thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.781 sec. • engine limits •