Base | Representation |
---|---|
bin | 1010000010100… |
… | …1000111011111 |
3 | 2221020111001112 |
4 | 2200221013133 |
5 | 41240031310 |
6 | 4102332235 |
7 | 1020640631 |
oct | 240510737 |
9 | 87214045 |
10 | 42111455 |
11 | 21852a61 |
12 | 1212a07b |
13 | 8955929 |
14 | 5842a51 |
15 | 3a6c705 |
hex | 28291df |
42111455 has 8 divisors (see below), whose sum is σ = 51006672. Its totient is φ = 33373888.
The previous prime is 42111409. The next prime is 42111473. The reversal of 42111455 is 55411124.
42111455 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.
It is a cyclic number.
It is not a de Polignac number, because 42111455 - 222 = 37917151 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 42111455.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 38822 + ... + 39891.
It is an arithmetic number, because the mean of its divisors is an integer number (6375834).
Almost surely, 242111455 is an apocalyptic number.
42111455 is a deficient number, since it is larger than the sum of its proper divisors (8895217).
42111455 is a wasteful number, since it uses less digits than its factorization.
42111455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78825.
The product of its digits is 800, while the sum is 23.
The square root of 42111455 is about 6489.3339411684. Note that the first 3 decimals coincide. The cubic root of 42111455 is about 347.9098695331.
Adding to 42111455 its reverse (55411124), we get a palindrome (97522579).
The spelling of 42111455 in words is "forty-two million, one hundred eleven thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •