Base | Representation |
---|---|
bin | 1010111100100… |
… | …1100000011110 |
3 | 10012101200100210 |
4 | 2233021200132 |
5 | 43223223032 |
6 | 4320033250 |
7 | 1065156321 |
oct | 257114036 |
9 | 105350323 |
10 | 45914142 |
11 | 23a0aa7a |
12 | 13462826 |
13 | 9687741 |
14 | 61527b8 |
15 | 406e2cc |
hex | 2bc981e |
45914142 has 8 divisors (see below), whose sum is σ = 91828296. Its totient is φ = 15304712.
The previous prime is 45914123. The next prime is 45914147. The reversal of 45914142 is 24141954.
45914142 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.
45914142 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45914147) 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, 3826173 + ... + 3826184.
It is an arithmetic number, because the mean of its divisors is an integer number (11478537).
Almost surely, 245914142 is an apocalyptic number.
45914142 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.
45914142 is a wasteful number, since it uses less digits than its factorization.
45914142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7652362.
The product of its digits is 5760, while the sum is 30.
The square root of 45914142 is about 6775.9974911448. The cubic root of 45914142 is about 358.0817255655.
It can be divided in two parts, 45914 and 142, that added together give a triangular number (46056 = T303).
The spelling of 45914142 in words is "forty-five million, nine hundred fourteen thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •