Base | Representation |
---|---|
bin | 1101010010100… |
… | …1010111000110 |
3 | 10212220002022110 |
4 | 3110221113012 |
5 | 103232301232 |
6 | 5310441450 |
7 | 1244546532 |
oct | 324512706 |
9 | 125802273 |
10 | 55743942 |
11 | 29514281 |
12 | 16803286 |
13 | b7199a7 |
14 | 7590bc2 |
15 | 4d61acc |
hex | 35295c6 |
55743942 has 8 divisors (see below), whose sum is σ = 111487896. Its totient is φ = 18581312.
The previous prime is 55743931. The next prime is 55743943. The reversal of 55743942 is 24934755.
55743942 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.
55743942 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 55743942.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55743943) 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, 4645323 + ... + 4645334.
It is an arithmetic number, because the mean of its divisors is an integer number (13935987).
Almost surely, 255743942 is an apocalyptic number.
55743942 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.
55743942 is a wasteful number, since it uses less digits than its factorization.
55743942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9290662.
The product of its digits is 151200, while the sum is 39.
The square root of 55743942 is about 7466.1865768276. The cubic root of 55743942 is about 382.0022248895.
The spelling of 55743942 in words is "fifty-five million, seven hundred forty-three thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •