Base | Representation |
---|---|
bin | 11010001010010… |
… | …110011110101100 |
3 | 1010120220111121020 |
4 | 122022112132230 |
5 | 1344330434012 |
6 | 111315334140 |
7 | 13606524306 |
oct | 3212263654 |
9 | 1116814536 |
10 | 438921132 |
11 | 205839a41 |
12 | 102bb1350 |
13 | 6cc1b060 |
14 | 42416976 |
15 | 28800a8c |
hex | 1a2967ac |
438921132 has 48 divisors (see below), whose sum is σ = 1110016992. Its totient is φ = 134184960.
The previous prime is 438921107. The next prime is 438921151. The reversal of 438921132 is 231129834.
It is a super-2 number, since 2×4389211322 = 385303520232322848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 438921093 and 438921102.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15532 + ... + 33452.
It is an arithmetic number, because the mean of its divisors is an integer number (23125354).
Almost surely, 2438921132 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 438921132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (555008496).
438921132 is an abundant number, since it is smaller than the sum of its proper divisors (671095860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
438921132 is a wasteful number, since it uses less digits than its factorization.
438921132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18098 (or 18096 counting only the distinct ones).
The product of its digits is 10368, while the sum is 33.
The square root of 438921132 is about 20950.4446730851. Note that the first 3 decimals coincide. The cubic root of 438921132 is about 759.9683343224.
The spelling of 438921132 in words is "four hundred thirty-eight million, nine hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •