Base | Representation |
---|---|
bin | 1010110010010… |
… | …0100110000110 |
3 | 10011010100210000 |
4 | 2230210212012 |
5 | 43040114122 |
6 | 4253342130 |
7 | 1056344100 |
oct | 254444606 |
9 | 104110700 |
10 | 45238662 |
11 | 23599527 |
12 | 13197946 |
13 | 94ac151 |
14 | 6018570 |
15 | 3e890ac |
hex | 2b24986 |
45238662 has 120 divisors (see below), whose sum is σ = 121663080. Its totient is φ = 12519360.
The previous prime is 45238651. The next prime is 45238681. The reversal of 45238662 is 26683254.
Its product of digits (69120) is a multiple of the sum of its prime divisors (192).
It is a congruent number.
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 59 ways as a sum of consecutive naturals, for example, 325389 + ... + 325527.
It is an arithmetic number, because the mean of its divisors is an integer number (1013859).
Almost surely, 245238662 is an apocalyptic number.
45238662 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 45238662, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60831540).
45238662 is an abundant number, since it is smaller than the sum of its proper divisors (76424418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45238662 is a wasteful number, since it uses less digits than its factorization.
45238662 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208 (or 192 counting only the distinct ones).
The product of its digits is 69120, while the sum is 36.
The square root of 45238662 is about 6725.9692238368. The cubic root of 45238662 is about 356.3170333693.
The spelling of 45238662 in words is "forty-five million, two hundred thirty-eight thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •