Base | Representation |
---|---|
bin | 1010111001001… |
… | …1110110000010 |
3 | 10011222111211220 |
4 | 2232103312002 |
5 | 43144204323 |
6 | 4311215510 |
7 | 1063252434 |
oct | 256236602 |
9 | 104874756 |
10 | 45694338 |
11 | 2387a918 |
12 | 13377596 |
13 | 960b691 |
14 | 60d6654 |
15 | 40290e3 |
hex | 2b93d82 |
45694338 has 8 divisors (see below), whose sum is σ = 91388688. Its totient is φ = 15231444.
The previous prime is 45694333. The next prime is 45694339. The reversal of 45694338 is 83349654.
45694338 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
45694338 is an admirable number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 45694338.
It is not an unprimeable number, because it can be changed into a prime (45694333) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 3807856 + ... + 3807867.
It is an arithmetic number, because the mean of its divisors is an integer number (11423586).
Almost surely, 245694338 is an apocalyptic number.
45694338 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45694338 is a wasteful number, since it uses less digits than its factorization.
45694338 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7615728.
The product of its digits is 311040, while the sum is 42.
The square root of 45694338 is about 6759.7587235049. The cubic root of 45694338 is about 357.5093984195.
The spelling of 45694338 in words is "forty-five million, six hundred ninety-four thousand, three hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •