Base | Representation |
---|---|
bin | 100111010100111001… |
… | …100000011001011111 |
3 | 11000222211201000101220 |
4 | 213110321200121133 |
5 | 1142434444102432 |
6 | 31222033304423 |
7 | 3023261520201 |
oct | 472471403137 |
9 | 130884630356 |
10 | 42226550367 |
11 | 169a9872311 |
12 | 8225705113 |
13 | 3c9c44b9a1 |
14 | 208819a771 |
15 | 11721ea72c |
hex | 9d4e6065f |
42226550367 has 4 divisors (see below), whose sum is σ = 56302067160. Its totient is φ = 28151033576.
The previous prime is 42226550363. The next prime is 42226550371. The reversal of 42226550367 is 76305562224.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (42226550363) and next prime (42226550371).
It is a cyclic number.
It is not a de Polignac number, because 42226550367 - 22 = 42226550363 is a prime.
It is a super-3 number, since 3×422265503673 (a number of 33 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42226550363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7037758392 + ... + 7037758397.
It is an arithmetic number, because the mean of its divisors is an integer number (14075516790).
Almost surely, 242226550367 is an apocalyptic number.
42226550367 is a deficient number, since it is larger than the sum of its proper divisors (14075516793).
42226550367 is a wasteful number, since it uses less digits than its factorization.
42226550367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14075516792.
The product of its (nonzero) digits is 604800, while the sum is 42.
The spelling of 42226550367 in words is "forty-two billion, two hundred twenty-six million, five hundred fifty thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •