Base | Representation |
---|---|
bin | 101010011001110000… |
… | …110001011011101000 |
3 | 11100112000112202110120 |
4 | 222121300301123220 |
5 | 1221221004404032 |
6 | 32525500243240 |
7 | 3201155165010 |
oct | 523160613350 |
9 | 140460482416 |
10 | 45529372392 |
11 | 18344164399 |
12 | 89a7840520 |
13 | 43a77ab64a |
14 | 22bcaacc40 |
15 | 12b715962c |
hex | a99c316e8 |
45529372392 has 128 divisors (see below), whose sum is σ = 142179287040. Its totient is φ = 11848227840.
The previous prime is 45529372379. The next prime is 45529372393. The reversal of 45529372392 is 29327392554.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (45529372393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 168588 + ... + 345659.
It is an arithmetic number, because the mean of its divisors is an integer number (1110775680).
Almost surely, 245529372392 is an apocalyptic number.
45529372392 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
45529372392 is an abundant number, since it is smaller than the sum of its proper divisors (96649914648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45529372392 is a wasteful number, since it uses less digits than its factorization.
45529372392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514311 (or 514307 counting only the distinct ones).
The product of its digits is 4082400, while the sum is 51.
The spelling of 45529372392 in words is "forty-five billion, five hundred twenty-nine million, three hundred seventy-two thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •