Base | Representation |
---|---|
bin | 100111010101111100… |
… | …111000000101100011 |
3 | 11001001001221021022000 |
4 | 213111330320011203 |
5 | 1143004004223133 |
6 | 31223504015043 |
7 | 3023564604066 |
oct | 472574700543 |
9 | 131031837260 |
10 | 42244211043 |
11 | 16a08835011 |
12 | 822b601483 |
13 | 3ca2cc33a8 |
14 | 208a6768dd |
15 | 1173a38413 |
hex | 9d5f38163 |
42244211043 has 32 divisors (see below), whose sum is σ = 64013068800. Its totient is φ = 27525260448.
The previous prime is 42244211033. The next prime is 42244211083. The reversal of 42244211043 is 34011244224.
42244211043 is a `hidden beast` number, since 4 + 224 + 421 + 10 + 4 + 3 = 666.
It is not a de Polignac number, because 42244211043 - 24 = 42244211027 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 42244210998 and 42244211016.
It is not an unprimeable number, because it can be changed into a prime (42244211003) 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 31 ways as a sum of consecutive naturals, for example, 198946 + ... + 352232.
It is an arithmetic number, because the mean of its divisors is an integer number (2000408400).
Almost surely, 242244211043 is an apocalyptic number.
42244211043 is a deficient number, since it is larger than the sum of its proper divisors (21768857757).
42244211043 is a wasteful number, since it uses less digits than its factorization.
42244211043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153528 (or 153522 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 42244211043 its reverse (34011244224), we get a palindrome (76255455267).
The spelling of 42244211043 in words is "forty-two billion, two hundred forty-four million, two hundred eleven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •