Base | Representation |
---|---|
bin | 1000110010001… |
… | …01000111101000 |
3 | 12010122111200000 |
4 | 10121011013220 |
5 | 122330332212 |
6 | 11151143000 |
7 | 1553204334 |
oct | 431050750 |
9 | 163574600 |
10 | 73683432 |
11 | 386574a9 |
12 | 20814a60 |
13 | 1235b284 |
14 | 9b007c4 |
15 | 67071dc |
hex | 46451e8 |
73683432 has 96 divisors (see below), whose sum is σ = 214250400. Its totient is φ = 23696064.
The previous prime is 73683413. The next prime is 73683469. The reversal of 73683432 is 23438637.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 55723 + ... + 57029.
It is an arithmetic number, because the mean of its divisors is an integer number (2231775).
Almost surely, 273683432 is an apocalyptic number.
73683432 is a gapful number since it is divisible by the number (72) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 73683432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107125200).
73683432 is an abundant number, since it is smaller than the sum of its proper divisors (140566968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
73683432 is a wasteful number, since it uses less digits than its factorization.
73683432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1357 (or 1341 counting only the distinct ones).
The product of its digits is 72576, while the sum is 36.
The square root of 73683432 is about 8583.9054048842. The cubic root of 73683432 is about 419.2341144323.
The spelling of 73683432 in words is "seventy-three million, six hundred eighty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •