Base | Representation |
---|---|
bin | 1010000100110… |
… | …0001111011011 |
3 | 2221111210101222 |
4 | 2201030033123 |
5 | 41304132243 |
6 | 4105402255 |
7 | 1022110235 |
oct | 241141733 |
9 | 87453358 |
10 | 42255323 |
11 | 21941060 |
12 | 1219938b |
13 | 89a6266 |
14 | 587d255 |
15 | 3a9a168 |
hex | 284c3db |
42255323 has 4 divisors (see below), whose sum is σ = 46096728. Its totient is φ = 38413920.
The previous prime is 42255307. The next prime is 42255329. The reversal of 42255323 is 32355224.
42255323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 42255323 - 24 = 42255307 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42255292 and 42255301.
It is not an unprimeable number, because it can be changed into a prime (42255329) 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, 1920686 + ... + 1920707.
It is an arithmetic number, because the mean of its divisors is an integer number (11524182).
Almost surely, 242255323 is an apocalyptic number.
42255323 is a deficient number, since it is larger than the sum of its proper divisors (3841405).
42255323 is a wasteful number, since it uses less digits than its factorization.
42255323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3841404.
The product of its digits is 7200, while the sum is 26.
The square root of 42255323 is about 6500.4094486424. The cubic root of 42255323 is about 348.3056146275.
Subtracting from 42255323 its reverse (32355224), we obtain a palindrome (9900099).
The spelling of 42255323 in words is "forty-two million, two hundred fifty-five thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •